Base | Representation |
---|---|
bin | 10000000000100011000… |
… | …100011110000100000011 |
3 | 10220011112212020101202102 |
4 | 100000203010132010003 |
5 | 121011001100031201 |
6 | 2201213504541015 |
7 | 142323334505501 |
oct | 20004304360403 |
9 | 3804485211672 |
10 | 1100100002051 |
11 | 394605854016 |
12 | 15925932176b |
13 | 7c97b71c99b |
14 | 3b360899671 |
15 | 1d93965626b |
hex | 1002311e103 |
1100100002051 has 2 divisors, whose sum is σ = 1100100002052. Its totient is φ = 1100100002050.
The previous prime is 1100100002017. The next prime is 1100100002063. The reversal of 1100100002051 is 1502000010011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1100100002051 - 210 = 1100100001027 is a prime.
It is a super-2 number, since 2×11001000020512 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1100100002951) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550050001025 + 550050001026.
It is an arithmetic number, because the mean of its divisors is an integer number (550050001026).
Almost surely, 21100100002051 is an apocalyptic number.
1100100002051 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100100002051 is an equidigital number, since it uses as much as digits as its factorization.
1100100002051 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10, while the sum is 11.
Adding to 1100100002051 its reverse (1502000010011), we get a palindrome (2602100012062).
The spelling of 1100100002051 in words is "one trillion, one hundred billion, one hundred million, two thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •