Base | Representation |
---|---|
bin | 11101000110101001010… |
… | …110110001100010011101 |
3 | 21002012100111221100122110 |
4 | 131012221112301202131 |
5 | 230232000241042341 |
6 | 4130442100504233 |
7 | 264331614646500 |
oct | 35065126614235 |
9 | 7065314840573 |
10 | 2000001112221 |
11 | 701217540482 |
12 | 2837443ab079 |
13 | 1167a38636a8 |
14 | 6cb2ca9d137 |
15 | 3705814c216 |
hex | 1d1a95b189d |
2000001112221 has 24 divisors (see below), whose sum is σ = 3103092266400. Its totient is φ = 1142471037792.
The previous prime is 2000001112211. The next prime is 2000001112237. The reversal of 2000001112221 is 1222111000002.
It is not a de Polignac number, because 2000001112221 - 29 = 2000001111709 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2000001112197 and 2000001112206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000001112211) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1865871 + ... + 2735228.
It is an arithmetic number, because the mean of its divisors is an integer number (129295511100).
Almost surely, 22000001112221 is an apocalyptic number.
2000001112221 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2000001112221 is a deficient number, since it is larger than the sum of its proper divisors (1103091154179).
2000001112221 is a wasteful number, since it uses less digits than its factorization.
2000001112221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4604073 (or 4604066 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 2000001112221 its reverse (1222111000002), we get a palindrome (3222112112223).
The spelling of 2000001112221 in words is "two trillion, one million, one hundred twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •