Base | Representation |
---|---|
bin | 1001000110001101001001… |
… | …0011001100001100000111 |
3 | 1022102012110100201010210112 |
4 | 2101203102103030030013 |
5 | 2302334012300023421 |
6 | 33134541450143235 |
7 | 2051431066104653 |
oct | 221432223141407 |
9 | 38365410633715 |
10 | 10002212111111 |
11 | 3206a06a85920 |
12 | 11565b4721b1b |
13 | 57728753a5cc |
14 | 268176c3da63 |
15 | 1252a925345b |
hex | 918d24cc307 |
10002212111111 has 8 divisors (see below), whose sum is σ = 10915863521664. Its totient is φ = 9089287267320.
The previous prime is 10002212111093. The next prime is 10002212111141. The reversal of 10002212111111 is 11111121220001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10002212111111 - 210 = 10002212110087 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10002212111141) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 181612901 + ... + 181667966.
It is an arithmetic number, because the mean of its divisors is an integer number (1364482940208).
Almost surely, 210002212111111 is an apocalyptic number.
10002212111111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10002212111111 is a deficient number, since it is larger than the sum of its proper divisors (913651410553).
10002212111111 is a wasteful number, since it uses less digits than its factorization.
10002212111111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 363283381.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 10002212111111 its reverse (11111121220001), we get a palindrome (21113333331112).
The spelling of 10002212111111 in words is "ten trillion, two billion, two hundred twelve million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.144 sec. • engine limits •