Base | Representation |
---|---|
bin | 1001000110001000101000… |
… | …0011110001011111100011 |
3 | 1022102002022220010002220101 |
4 | 2101202022003301133203 |
5 | 2302324022012010201 |
6 | 33134221312523231 |
7 | 2051356051214116 |
oct | 221421203613743 |
9 | 38362286102811 |
10 | 10001000110051 |
11 | 3206444922555 |
12 | 1156316850517 |
13 | 577123403812 |
14 | 26809dca857d |
15 | 125237b46d01 |
hex | 9188a0f17e3 |
10001000110051 has 2 divisors, whose sum is σ = 10001000110052. Its totient is φ = 10001000110050.
The previous prime is 10001000110037. The next prime is 10001000110061. The reversal of 10001000110051 is 15001100010001.
It is an a-pointer prime, because the next prime (10001000110061) can be obtained adding 10001000110051 to its sum of digits (10).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10001000110051 - 27 = 10001000109923 is a prime.
It is a super-2 number, since 2×100010001100512 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10001000110061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5000500055025 + 5000500055026.
It is an arithmetic number, because the mean of its divisors is an integer number (5000500055026).
Almost surely, 210001000110051 is an apocalyptic number.
10001000110051 is a deficient number, since it is larger than the sum of its proper divisors (1).
10001000110051 is an equidigital number, since it uses as much as digits as its factorization.
10001000110051 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5, while the sum is 10.
Adding to 10001000110051 its reverse (15001100010001), we get a palindrome (25002100120052).
The spelling of 10001000110051 in words is "ten trillion, one billion, one hundred ten thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •