Base | Representation |
---|---|
bin | 10001100110111010110… |
… | …011111111100011011010 |
3 | 11021200021101002221201000 |
4 | 101212322303333203122 |
5 | 124311110110031020 |
6 | 2323513040005430 |
7 | 153264265212621 |
oct | 21467263774332 |
9 | 4250241087630 |
10 | 1210020002010 |
11 | 427191822996 |
12 | 176615300876 |
13 | 8a148489491 |
14 | 427cb1b66b8 |
15 | 2171e6ea090 |
hex | 119bacff8da |
1210020002010 has 64 divisors (see below), whose sum is σ = 3274880054400. Its totient is φ = 317855995776.
The previous prime is 1210020001991. The next prime is 1210020002011. The reversal of 1210020002010 is 102000200121.
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 = 1210020001983 and 1210020002001.
It is not an unprimeable number, because it can be changed into a prime (1210020002011) 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, 33426355 + ... + 33462534.
It is an arithmetic number, because the mean of its divisors is an integer number (51170000850).
Almost surely, 21210020002010 is an apocalyptic number.
1210020002010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1210020002010 is an abundant number, since it is smaller than the sum of its proper divisors (2064860052390).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1210020002010 is a wasteful number, since it uses less digits than its factorization.
1210020002010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66888972 (or 66888966 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 1210020002010 its reverse (102000200121), we get a palindrome (1312020202131).
The spelling of 1210020002010 in words is "one trillion, two hundred ten billion, twenty million, two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •