Base | Representation |
---|---|
bin | 11110110111101000001… |
… | …000000111110001000001 |
3 | 21111210110222021000211001 |
4 | 132313220020013301001 |
5 | 234223422202220001 |
6 | 4302303510252001 |
7 | 306155056465531 |
oct | 36675010076101 |
9 | 7453428230731 |
10 | 2121313320001 |
11 | 74870a080737 |
12 | 2a315b657001 |
13 | 12506786b465 |
14 | 7495a3c34c1 |
15 | 3a2a8405001 |
hex | 1ede8207c41 |
2121313320001 has 16 divisors (see below), whose sum is σ = 2177610177600. Its totient is φ = 2065335370560.
The previous prime is 2121313319989. The next prime is 2121313320011. The reversal of 2121313320001 is 1000233131212.
It is a cyclic number.
It is not a de Polignac number, because 2121313320001 - 211 = 2121313317953 is a prime.
It is a super-2 number, since 2×21213133200012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2121313320011) 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 15 ways as a sum of consecutive naturals, for example, 103221675 + ... + 103242223.
It is an arithmetic number, because the mean of its divisors is an integer number (136100636100).
Almost surely, 22121313320001 is an apocalyptic number.
It is an amenable number.
2121313320001 is a deficient number, since it is larger than the sum of its proper divisors (56296857599).
2121313320001 is a wasteful number, since it uses less digits than its factorization.
2121313320001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28176.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 2121313320001 its reverse (1000233131212), we get a palindrome (3121546451213).
The spelling of 2121313320001 in words is "two trillion, one hundred twenty-one billion, three hundred thirteen million, three hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •