Base | Representation |
---|---|
bin | 11101000111100100111… |
… | …001010110000000001110 |
3 | 21002021221010120122112110 |
4 | 131013210321112000032 |
5 | 230241022001431342 |
6 | 4131125143044450 |
7 | 264365434423044 |
oct | 35074471260016 |
9 | 7067833518473 |
10 | 2001000030222 |
11 | 70168a395346 |
12 | 283982a40726 |
13 | 1169027b222b |
14 | 6cbc5608394 |
15 | 370b5bb7c9c |
hex | 1d1e4e5600e |
2001000030222 has 16 divisors (see below), whose sum is σ = 4176000063360. Its totient is φ = 638000009592.
The previous prime is 2001000030181. The next prime is 2001000030257. The reversal of 2001000030222 is 2220300001002.
It is a super-2 number, since 2×20010000302222 (a number of 25 digits) contains 22 as substring.
2001000030222 is a modest number, since divided by 30222 gives 20010 as remainder.
It is a junction number, because it is equal to n+sod(n) for n = 2001000030198 and 2001000030207.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 7249999972 + ... + 7250000247.
It is an arithmetic number, because the mean of its divisors is an integer number (261000003960).
Almost surely, 22001000030222 is an apocalyptic number.
2001000030222 is an abundant number, since it is smaller than the sum of its proper divisors (2175000033138).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2001000030222 is a wasteful number, since it uses less digits than its factorization.
2001000030222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14500000247.
The product of its (nonzero) digits is 48, while the sum is 12.
Adding to 2001000030222 its reverse (2220300001002), we get a palindrome (4221300031224).
The spelling of 2001000030222 in words is "two trillion, one billion, thirty thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •