Base | Representation |
---|---|
bin | 11110110111010110000… |
… | …110111001111000101001 |
3 | 21111202200220102010222120 |
4 | 132313112012321320221 |
5 | 234222312304323423 |
6 | 4302213510541453 |
7 | 306144426061521 |
oct | 36672606717051 |
9 | 7452626363876 |
10 | 2121011011113 |
11 | 74857446a585 |
12 | 2a3096367889 |
13 | 12501a042767 |
14 | 7492c1ac681 |
15 | 3a28badbee3 |
hex | 1edd61b9e29 |
2121011011113 has 8 divisors (see below), whose sum is σ = 2863812336000. Its totient is φ = 1396108513488.
The previous prime is 2121011011109. The next prime is 2121011011129. The reversal of 2121011011113 is 3111101101212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2121011011113 - 22 = 2121011011109 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2121011011092 and 2121011011101.
It is not an unprimeable number, because it can be changed into a prime (2121011011913) 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, 4474706538 + ... + 4474707011.
It is an arithmetic number, because the mean of its divisors is an integer number (357976542000).
Almost surely, 22121011011113 is an apocalyptic number.
It is an amenable number.
2121011011113 is a deficient number, since it is larger than the sum of its proper divisors (742801324887).
2121011011113 is an equidigital number, since it uses as much as digits as its factorization.
2121011011113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8949413631.
The product of its (nonzero) digits is 12, while the sum is 15.
Adding to 2121011011113 its reverse (3111101101212), we get a palindrome (5232112112325).
Subtracting 2121011011113 from its reverse (3111101101212), we obtain a palindrome (990090090099).
The spelling of 2121011011113 in words is "two trillion, one hundred twenty-one billion, eleven million, eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •