Base | Representation |
---|---|
bin | 11001110100011100010101… |
… | …100100000000101011011111 |
3 | 112220001202022100011222021002 |
4 | 121310130111210000223133 |
5 | 104340441121014203242 |
6 | 1041302240420300515 |
7 | 32630035545012305 |
oct | 3164342544005337 |
9 | 486052270158232 |
10 | 113555002100447 |
11 | 33200451349526 |
12 | 1089b87854173b |
13 | 4b4926310479b |
14 | 200813cc38275 |
15 | d1dc5d64d432 |
hex | 674715900adf |
113555002100447 has 2 divisors, whose sum is σ = 113555002100448. Its totient is φ = 113555002100446.
The previous prime is 113555002100401. The next prime is 113555002100549. The reversal of 113555002100447 is 744001200555311.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 113555002100447 - 228 = 113554733664991 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 113555002100447.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113555002102447) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56777501050223 + 56777501050224.
It is an arithmetic number, because the mean of its divisors is an integer number (56777501050224).
Almost surely, 2113555002100447 is an apocalyptic number.
113555002100447 is a deficient number, since it is larger than the sum of its proper divisors (1).
113555002100447 is an equidigital number, since it uses as much as digits as its factorization.
113555002100447 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84000, while the sum is 38.
Adding to 113555002100447 its reverse (744001200555311), we get a palindrome (857556202655758).
The spelling of 113555002100447 in words is "one hundred thirteen trillion, five hundred fifty-five billion, two million, one hundred thousand, four hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •