Base | Representation |
---|---|
bin | 1001001100100110010000… |
… | …0110000010111000011001 |
3 | 1022210200220220210211120102 |
4 | 2103021210012002320121 |
5 | 2311133420233233144 |
6 | 33301223054305145 |
7 | 2062366405353101 |
oct | 223114406027031 |
9 | 38720826724512 |
10 | 10112032321049 |
11 | 3249541696aaa |
12 | 11739431b81b5 |
13 | 584739708059 |
14 | 26d5d41c2201 |
15 | 128085684b4e |
hex | 93264182e19 |
10112032321049 has 2 divisors, whose sum is σ = 10112032321050. Its totient is φ = 10112032321048.
The previous prime is 10112032321009. The next prime is 10112032321141. The reversal of 10112032321049 is 94012323021101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9805634646025 + 306397675024 = 3131395^2 + 553532^2 .
It is an emirp because it is prime and its reverse (94012323021101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10112032321049 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (10112032321009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5056016160524 + 5056016160525.
It is an arithmetic number, because the mean of its divisors is an integer number (5056016160525).
Almost surely, 210112032321049 is an apocalyptic number.
It is an amenable number.
10112032321049 is a deficient number, since it is larger than the sum of its proper divisors (1).
10112032321049 is an equidigital number, since it uses as much as digits as its factorization.
10112032321049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 29.
The spelling of 10112032321049 in words is "ten trillion, one hundred twelve billion, thirty-two million, three hundred twenty-one thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •