Base | Representation |
---|---|
bin | 11001000000110111101010… |
… | …101000111011111010010011 |
3 | 112102111221110010201002201201 |
4 | 121000313222220323322103 |
5 | 103404404343042432042 |
6 | 1025550154140212031 |
7 | 32113012332546214 |
oct | 3100675250737223 |
9 | 472457403632651 |
10 | 110010933952147 |
11 | 32064414267288 |
12 | 10408a3323a017 |
13 | 494cca9612127 |
14 | 1d247b413b40b |
15 | cab9845a71b7 |
hex | 640deaa3be93 |
110010933952147 has 2 divisors, whose sum is σ = 110010933952148. Its totient is φ = 110010933952146.
The previous prime is 110010933952057. The next prime is 110010933952151. The reversal of 110010933952147 is 741259339010011.
It is a strong prime.
It is an emirp because it is prime and its reverse (741259339010011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110010933952147 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110010933952097 and 110010933952106.
It is not a weakly prime, because it can be changed into another prime (110010933052147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55005466976073 + 55005466976074.
It is an arithmetic number, because the mean of its divisors is an integer number (55005466976074).
Almost surely, 2110010933952147 is an apocalyptic number.
110010933952147 is a deficient number, since it is larger than the sum of its proper divisors (1).
110010933952147 is an equidigital number, since it uses as much as digits as its factorization.
110010933952147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 204120, while the sum is 46.
The spelling of 110010933952147 in words is "one hundred ten trillion, ten billion, nine hundred thirty-three million, nine hundred fifty-two thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •