Base | Representation |
---|---|
bin | 11101000110101011101… |
… | …10011010000100000011 |
3 | 10112121020010110211010211 |
4 | 32203111312122010003 |
5 | 112341020134102321 |
6 | 2043223011534551 |
7 | 132151301431633 |
oct | 16432566320403 |
9 | 3477203424124 |
10 | 1000020222211 |
11 | 35611938816a |
12 | 1419888ba457 |
13 | 733bc52914a |
14 | 36588dcc6c3 |
15 | 1b02d40d0e1 |
hex | e8d5d9a103 |
1000020222211 has 8 divisors (see below), whose sum is σ = 1001741225600. Its totient is φ = 998299461888.
The previous prime is 1000020222199. The next prime is 1000020222221. The reversal of 1000020222211 is 1122220200001.
It is a happy number.
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 1000020222211 - 213 = 1000020214019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1000020222191 and 1000020222200.
It is not an unprimeable number, because it can be changed into a prime (1000020222221) 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 7 ways as a sum of consecutive naturals, for example, 9446305 + ... + 9551581.
It is an arithmetic number, because the mean of its divisors is an integer number (125217653200).
Almost surely, 21000020222211 is an apocalyptic number.
1000020222211 is a deficient number, since it is larger than the sum of its proper divisors (1721003389).
1000020222211 is a wasteful number, since it uses less digits than its factorization.
1000020222211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121533.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 1000020222211 its reverse (1122220200001), we get a palindrome (2122240422212).
The spelling of 1000020222211 in words is "one trillion, twenty million, two hundred twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •