Base | Representation |
---|---|
bin | 11101011101011000110… |
… | …11011111010110011010 |
3 | 10120202200200001221210010 |
4 | 32232230123133112122 |
5 | 113041001302431020 |
6 | 2053000345302350 |
7 | 133062340520430 |
oct | 16565433372632 |
9 | 3522620057703 |
10 | 1012210202010 |
11 | 3603042a8437 |
12 | 14420b1949b6 |
13 | 745b2b4a147 |
14 | 36dc3d40d50 |
15 | 1b4e36a8de0 |
hex | ebac6df59a |
1012210202010 has 128 divisors (see below), whose sum is σ = 2803137269760. Its totient is φ = 229131201024.
The previous prime is 1012210201867. The next prime is 1012210202011. The reversal of 1012210202010 is 102020122101.
It is not an unprimeable number, because it can be changed into a prime (1012210202011) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 132501771 + ... + 132509409.
It is an arithmetic number, because the mean of its divisors is an integer number (21899509920).
Almost surely, 21012210202010 is an apocalyptic number.
1012210202010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1012210202010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1401568634880).
1012210202010 is an abundant number, since it is smaller than the sum of its proper divisors (1790927067750).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1012210202010 is a wasteful number, since it uses less digits than its factorization.
1012210202010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13660.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 1012210202010 its reverse (102020122101), we get a palindrome (1114230324111).
The spelling of 1012210202010 in words is "one trillion, twelve billion, two hundred ten million, two hundred two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •