Base | Representation |
---|---|
bin | 1010000110110000011110… |
… | …1110011100110111000101 |
3 | 1110100012222022220122020111 |
4 | 2201230013232130313011 |
5 | 2424021224230341401 |
6 | 35344230332033021 |
7 | 2224521066532003 |
oct | 241540756346705 |
9 | 43305868818214 |
10 | 11111210012101 |
11 | 35a4268424021 |
12 | 12b5515902771 |
13 | 627a2350c644 |
14 | 2a5add333a73 |
15 | 144064b18e51 |
hex | a1b07b9cdc5 |
11111210012101 has 8 divisors (see below), whose sum is σ = 11114404608384. Its totient is φ = 11108015738400.
The previous prime is 11111210012087. The next prime is 11111210012153. The reversal of 11111210012101 is 10121001211111.
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 11111210012101 - 211 = 11111210010053 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 (11111210082101) 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 7 ways as a sum of consecutive naturals, for example, 79946196 + ... + 80085058.
It is an arithmetic number, because the mean of its divisors is an integer number (1389300576048).
Almost surely, 211111210012101 is an apocalyptic number.
It is an amenable number.
11111210012101 is a deficient number, since it is larger than the sum of its proper divisors (3194596283).
11111210012101 is a wasteful number, since it uses less digits than its factorization.
11111210012101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161291.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 11111210012101 its reverse (10121001211111), we get a palindrome (21232211223212).
The spelling of 11111210012101 in words is "eleven trillion, one hundred eleven billion, two hundred ten million, twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •