Base | Representation |
---|---|
bin | 11101001010011010010… |
… | …10100111110010011010 |
3 | 10112210101122012011202200 |
4 | 32211031022213302122 |
5 | 112404120113310020 |
6 | 2044153401111030 |
7 | 132252016360650 |
oct | 16451512476232 |
9 | 3483348164680 |
10 | 1002022010010 |
11 | 356a56335a4a |
12 | 142247188476 |
13 | 7364b17b178 |
14 | 366d8bd0dd0 |
15 | 1b0e9025590 |
hex | e94d2a7c9a |
1002022010010 has 96 divisors (see below), whose sum is σ = 2978818682112. Its totient is φ = 228927306240.
The previous prime is 1002022009997. The next prime is 1002022010023. The reversal of 1002022010010 is 100102202001.
It is an interprime number because it is at equal distance from previous prime (1002022009997) and next prime (1002022010023).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1002022009974 and 1002022010001.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 993427 + ... + 1729433.
It is an arithmetic number, because the mean of its divisors is an integer number (31029361272).
Almost surely, 21002022010010 is an apocalyptic number.
1002022010010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1002022010010 is an abundant number, since it is smaller than the sum of its proper divisors (1976796672102).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1002022010010 is a wasteful number, since it uses less digits than its factorization.
1002022010010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 738188 (or 738185 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 1002022010010 its reverse (100102202001), we get a palindrome (1102124212011).
The spelling of 1002022010010 in words is "one trillion, two billion, twenty-two million, ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •