Base | Representation |
---|---|
bin | 11110100100110100000… |
… | …011000000001001010111 |
3 | 21102212100010022022112000 |
4 | 132210310003000021113 |
5 | 233411034211210012 |
6 | 4245123154330343 |
7 | 304541343052236 |
oct | 36446403001127 |
9 | 7385303268460 |
10 | 2101112210007 |
11 | 740093080808 |
12 | 29b2622899b3 |
13 | 12319860b235 |
14 | 739a150ab1d |
15 | 399c4bb0ddc |
hex | 1e9340c0257 |
2101112210007 has 8 divisors (see below), whose sum is σ = 3112758829680. Its totient is φ = 1400741473320.
The previous prime is 2101112209979. The next prime is 2101112210023. The reversal of 2101112210007 is 7000122111012.
It is not a de Polignac number, because 2101112210007 - 27 = 2101112209879 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2101112210047) 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 in 7 ways as a sum of consecutive naturals, for example, 38909485344 + ... + 38909485397.
It is an arithmetic number, because the mean of its divisors is an integer number (389094853710).
Almost surely, 22101112210007 is an apocalyptic number.
2101112210007 is a gapful number since it is divisible by the number (27) formed by its first and last digit.
2101112210007 is a deficient number, since it is larger than the sum of its proper divisors (1011646619673).
2101112210007 is an equidigital number, since it uses as much as digits as its factorization.
2101112210007 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77818970750 (or 77818970744 counting only the distinct ones).
The product of its (nonzero) digits is 56, while the sum is 18.
Adding to 2101112210007 its reverse (7000122111012), we get a palindrome (9101234321019).
The spelling of 2101112210007 in words is "two trillion, one hundred one billion, one hundred twelve million, two hundred ten thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •