Base | Representation |
---|---|
bin | 1001010011100010010001… |
… | …0000100011111000001111 |
3 | 1100020002120100020121100202 |
4 | 2110320210100203320033 |
5 | 2320112014411420421 |
6 | 33432054025044115 |
7 | 2104116115444265 |
oct | 224704420437017 |
9 | 40202510217322 |
10 | 10231220420111 |
11 | 3295044221a09 |
12 | 1192a6702663b |
13 | 592a52633662 |
14 | 27529d782435 |
15 | 12b20e21210b |
hex | 94e24423e0f |
10231220420111 has 4 divisors (see below), whose sum is σ = 10769705705400. Its totient is φ = 9692735134824.
The previous prime is 10231220420053. The next prime is 10231220420153. The reversal of 10231220420111 is 11102402213201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10231220420111 - 230 = 10230146678287 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 (10231220420191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 269242642616 + ... + 269242642653.
It is an arithmetic number, because the mean of its divisors is an integer number (2692426426350).
Almost surely, 210231220420111 is an apocalyptic number.
10231220420111 is a deficient number, since it is larger than the sum of its proper divisors (538485285289).
10231220420111 is an equidigital number, since it uses as much as digits as its factorization.
10231220420111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 538485285288.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 10231220420111 its reverse (11102402213201), we get a palindrome (21333622633312).
The spelling of 10231220420111 in words is "ten trillion, two hundred thirty-one billion, two hundred twenty million, four hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •