Base | Representation |
---|---|
bin | 1001000111010110111001… |
… | …1110001010001001011011 |
3 | 1022111002120020212212001012 |
4 | 2101311232132022021123 |
5 | 2303200040044214321 |
6 | 33152014312444135 |
7 | 2053031542203425 |
oct | 221655636121133 |
9 | 38432506785035 |
10 | 10022012101211 |
11 | 3214347615500 |
12 | 115a3bb6a964b |
13 | 5790c1656596 |
14 | 2690d473d815 |
15 | 125a6766205b |
hex | 91d6e78a25b |
10022012101211 has 12 divisors (see below), whose sum is σ = 11016938226000. Its totient is φ = 9110086764240.
The previous prime is 10022012101177. The next prime is 10022012101247. The reversal of 10022012101211 is 11210121022001.
It is a de Polignac number, because none of the positive numbers 2k-10022012101211 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10022012101111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2457551 + ... + 5107208.
It is an arithmetic number, because the mean of its divisors is an integer number (918078185500).
Almost surely, 210022012101211 is an apocalyptic number.
10022012101211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10022012101211 is a deficient number, since it is larger than the sum of its proper divisors (994926124789).
10022012101211 is a wasteful number, since it uses less digits than its factorization.
10022012101211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7575730 (or 7575719 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 10022012101211 its reverse (11210121022001), we get a palindrome (21232133123212).
The spelling of 10022012101211 in words is "ten trillion, twenty-two billion, twelve million, one hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •