Base | Representation |
---|---|
bin | 110100110001010001… |
… | …1011101101001011001 |
3 | 101211111122111020000022 |
4 | 1221202203131221121 |
5 | 3324041042111322 |
6 | 124020520520225 |
7 | 11121145214543 |
oct | 1514243355131 |
9 | 354448436008 |
10 | 113322613337 |
11 | 4407272a74a |
12 | 19b67620075 |
13 | a8bc998cbb |
14 | 56b05a8693 |
15 | 2e33b65942 |
hex | 1a628dda59 |
113322613337 has 2 divisors, whose sum is σ = 113322613338. Its totient is φ = 113322613336.
The previous prime is 113322613307. The next prime is 113322613423. The reversal of 113322613337 is 733316223311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 91020476416 + 22302136921 = 301696^2 + 149339^2 .
It is a cyclic number.
It is not a de Polignac number, because 113322613337 - 218 = 113322351193 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 113322613297 and 113322613306.
It is not a weakly prime, because it can be changed into another prime (113322613307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56661306668 + 56661306669.
It is an arithmetic number, because the mean of its divisors is an integer number (56661306669).
Almost surely, 2113322613337 is an apocalyptic number.
It is an amenable number.
113322613337 is a deficient number, since it is larger than the sum of its proper divisors (1).
113322613337 is an equidigital number, since it uses as much as digits as its factorization.
113322613337 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 40824, while the sum is 35.
Adding to 113322613337 its reverse (733316223311), we get a palindrome (846638836648).
The spelling of 113322613337 in words is "one hundred thirteen billion, three hundred twenty-two million, six hundred thirteen thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •