Base | Representation |
---|---|
bin | 11101001010101111110… |
… | …10000001111011100101 |
3 | 10112210212012021021201011 |
4 | 32211113322001323211 |
5 | 112410002231210041 |
6 | 2044223315302221 |
7 | 132256335141265 |
oct | 16452772017345 |
9 | 3483765237634 |
10 | 1002202210021 |
11 | 357039024981 |
12 | 1422975aa971 |
13 | 736795c20ac |
14 | 36714adb7a5 |
15 | 1b109c6ce81 |
hex | e957e81ee5 |
1002202210021 has 16 divisors (see below), whose sum is σ = 1022137272000. Its totient is φ = 982484350848.
The previous prime is 1002202209991. The next prime is 1002202210057. The reversal of 1002202210021 is 1200122022001.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1002202210021 - 25 = 1002202209989 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1002202209983 and 1002202210010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1002202217021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7184686 + ... + 7322848.
It is an arithmetic number, because the mean of its divisors is an integer number (63883579500).
Almost surely, 21002202210021 is an apocalyptic number.
It is an amenable number.
1002202210021 is a deficient number, since it is larger than the sum of its proper divisors (19935061979).
1002202210021 is a wasteful number, since it uses less digits than its factorization.
1002202210021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138948.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 1002202210021 its reverse (1200122022001), we get a palindrome (2202324232022).
The spelling of 1002202210021 in words is "one trillion, two billion, two hundred two million, two hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •