Base | Representation |
---|---|
bin | 1001000111010011100011… |
… | …0000110001111101101111 |
3 | 1022111000020110022211201022 |
4 | 2101310320300301331233 |
5 | 2303141213404410411 |
6 | 33151345043204355 |
7 | 2053000321113653 |
oct | 221647060617557 |
9 | 38430213284638 |
10 | 10021111013231 |
11 | 3213a24a0a79a |
12 | 115a1a99766bb |
13 | 578ca9a6b926 |
14 | 26904abbca63 |
15 | 125a134bcedb |
hex | 91d38c31f6f |
10021111013231 has 8 divisors (see below), whose sum is σ = 10170891471744. Its totient is φ = 9871336779480.
The previous prime is 10021111013203. The next prime is 10021111013239. The reversal of 10021111013231 is 13231011112001.
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 10021111013231 - 214 = 10021110996847 is a prime.
It is a super-2 number, since 2×100211110132312 (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 (10021111013239) 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, 1739396 + ... + 4802886.
It is an arithmetic number, because the mean of its divisors is an integer number (1271361433968).
Almost surely, 210021111013231 is an apocalyptic number.
10021111013231 is a deficient number, since it is larger than the sum of its proper divisors (149780458513).
10021111013231 is an equidigital number, since it uses as much as digits as its factorization.
10021111013231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3112381.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 10021111013231 its reverse (13231011112001), we get a palindrome (23252122125232).
The spelling of 10021111013231 in words is "ten trillion, twenty-one billion, one hundred eleven million, thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •