Base | Representation |
---|---|
bin | 11101001010100110000… |
… | …01001110101001000010 |
3 | 10112210122110222022012202 |
4 | 32211103001032221002 |
5 | 112404320233223020 |
6 | 2044211225553202 |
7 | 132254321151152 |
oct | 16452301165102 |
9 | 3483573868182 |
10 | 1002120211010 |
11 | 356aa68088a6 |
12 | 142274045802 |
13 | 73665611b79 |
14 | 36707c74762 |
15 | 1b102971e75 |
hex | e95304ea42 |
1002120211010 has 32 divisors (see below), whose sum is σ = 1806225220800. Its totient is φ = 400313154112.
The previous prime is 1002120211003. The next prime is 1002120211013. The reversal of 1002120211010 is 101120212001.
It is a junction number, because it is equal to n+sod(n) for n = 1002120210982 and 1002120211000.
It is not an unprimeable number, because it can be changed into a prime (1002120211013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23338541 + ... + 23381439.
It is an arithmetic number, because the mean of its divisors is an integer number (56444538150).
Almost surely, 21002120211010 is an apocalyptic number.
1002120211010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1002120211010 is a deficient number, since it is larger than the sum of its proper divisors (804105009790).
1002120211010 is a wasteful number, since it uses less digits than its factorization.
1002120211010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45970.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1002120211010 its reverse (101120212001), we get a palindrome (1103240423011).
Subtracting from 1002120211010 its reverse (101120212001), we obtain a palindrome (900999999009).
The spelling of 1002120211010 in words is "one trillion, two billion, one hundred twenty million, two hundred eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •