Base | Representation |
---|---|
bin | 111111001111011… |
… | …0010011010000001 |
3 | 12110212220202202122 |
4 | 1332132302122001 |
5 | 13321213000001 |
6 | 550321454025 |
7 | 103404462632 |
oct | 17636623201 |
9 | 5425822678 |
10 | 2122000001 |
11 | 9998a5010 |
12 | 4b27a1315 |
13 | 27a821704 |
14 | 161b75889 |
15 | c6460b1b |
hex | 7e7b2681 |
2122000001 has 8 divisors (see below), whose sum is σ = 2337830208. Its totient is φ = 1909990000.
The previous prime is 2121999973. The next prime is 2122000019. The reversal of 2122000001 is 1000002212.
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 2122000001 - 26 = 2121999937 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2122000021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 953885 + ... + 956106.
It is an arithmetic number, because the mean of its divisors is an integer number (292228776).
Almost surely, 22122000001 is an apocalyptic number.
It is an amenable number.
2122000001 is a deficient number, since it is larger than the sum of its proper divisors (215830207).
2122000001 is a wasteful number, since it uses less digits than its factorization.
2122000001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1910103.
The product of its (nonzero) digits is 8, while the sum is 8.
The square root of 2122000001 is about 46065.1712359783. The cubic root of 2122000001 is about 1285.0355031650.
Adding to 2122000001 its reverse (1000002212), we get a palindrome (3122002213).
It can be divided in two parts, 21 and 22000001, that added together give a palindrome (22000022).
The spelling of 2122000001 in words is "two billion, one hundred twenty-two million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •