Base | Representation |
---|---|
bin | 1001000111010011111011… |
… | …0010011011110100011111 |
3 | 1022111000111111120002120012 |
4 | 2101310332302123310133 |
5 | 2303141420300010421 |
6 | 33151403054113435 |
7 | 2053002656325026 |
oct | 221647662336437 |
9 | 38430444502505 |
10 | 10021212110111 |
11 | 3213a76a90334 |
12 | 115a2177ab87b |
13 | 578cc49a7777 |
14 | 26905a3b78bd |
15 | 125a1c2dc95b |
hex | 91d3ec9bd1f |
10021212110111 has 8 divisors (see below), whose sum is σ = 10031727030000. Its totient is φ = 10010698346880.
The previous prime is 10021212110059. The next prime is 10021212110123. The reversal of 10021212110111 is 11101121212001.
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 10021212110111 - 26 = 10021212110047 is a prime.
It is a super-2 number, since 2×100212121101112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10021212110191) 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, 17628956 + ... + 18188526.
It is an arithmetic number, because the mean of its divisors is an integer number (1253965878750).
Almost surely, 210021212110111 is an apocalyptic number.
10021212110111 is a deficient number, since it is larger than the sum of its proper divisors (10514919889).
10021212110111 is a wasteful number, since it uses less digits than its factorization.
10021212110111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 578329.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 10021212110111 its reverse (11101121212001), we get a palindrome (21122333322112).
The spelling of 10021212110111 in words is "ten trillion, twenty-one billion, two hundred twelve million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •