Base | Representation |
---|---|
bin | 110100101101111100… |
… | …0101110110101000101 |
3 | 101211012211222212221011 |
4 | 1221123320232311011 |
5 | 3323323422420404 |
6 | 124001443122221 |
7 | 11115316324315 |
oct | 1513370566505 |
9 | 354184885834 |
10 | 113210748229 |
11 | 44015574847 |
12 | 19b36073371 |
13 | a8a275ca27 |
14 | 569d7a9445 |
15 | 2e28e1a604 |
hex | 1a5be2ed45 |
113210748229 has 2 divisors, whose sum is σ = 113210748230. Its totient is φ = 113210748228.
The previous prime is 113210748173. The next prime is 113210748239. The reversal of 113210748229 is 922847012311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 97673125729 + 15537622500 = 312527^2 + 124650^2 .
It is a cyclic number.
It is not a de Polignac number, because 113210748229 - 213 = 113210740037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 113210748191 and 113210748200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113210748239) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56605374114 + 56605374115.
It is an arithmetic number, because the mean of its divisors is an integer number (56605374115).
Almost surely, 2113210748229 is an apocalyptic number.
It is an amenable number.
113210748229 is a deficient number, since it is larger than the sum of its proper divisors (1).
113210748229 is an equidigital number, since it uses as much as digits as its factorization.
113210748229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48384, while the sum is 40.
The spelling of 113210748229 in words is "one hundred thirteen billion, two hundred ten million, seven hundred forty-eight thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •