Base | Representation |
---|---|
bin | 11101001000100011000… |
… | …11111110001001001101 |
3 | 10112200210221112112101220 |
4 | 32210101203332021031 |
5 | 112400043114202341 |
6 | 2043510235553553 |
7 | 132215154540444 |
oct | 16442143761115 |
9 | 3480727475356 |
10 | 1001022022221 |
11 | 356592920361 |
12 | 1420082bb8b9 |
13 | 7351bc46710 |
14 | 36642087d5b |
15 | 1b08b347a66 |
hex | e9118fe24d |
1001022022221 has 32 divisors (see below), whose sum is σ = 1440271765632. Its totient is φ = 614768590080.
The previous prime is 1001022022201. The next prime is 1001022022249. The reversal of 1001022022221 is 1222202201001.
1001022022221 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1001022022221 - 26 = 1001022022157 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1001022022221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1001022022201) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 76041586 + ... + 76054748.
It is an arithmetic number, because the mean of its divisors is an integer number (45008492676).
Almost surely, 21001022022221 is an apocalyptic number.
It is an amenable number.
1001022022221 is a deficient number, since it is larger than the sum of its proper divisors (439249743411).
1001022022221 is a wasteful number, since it uses less digits than its factorization.
1001022022221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16973.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 1001022022221 its reverse (1222202201001), we get a palindrome (2223224223222).
The spelling of 1001022022221 in words is "one trillion, one billion, twenty-two million, twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •