Base | Representation |
---|---|
bin | 1001001011111101001110… |
… | …1101011010011011100010 |
3 | 1022202122111110012111001000 |
4 | 2102333103231122123202 |
5 | 2310443342110311320 |
6 | 33252202230252430 |
7 | 2061526456304433 |
oct | 222772355323342 |
9 | 38678443174030 |
10 | 10101020010210 |
11 | 324490050a968 |
12 | 117178b1b7116 |
13 | 5836a30900ac |
14 | 26cc6b82948a |
15 | 127b3d9b2c90 |
hex | 92fd3b5a6e2 |
10101020010210 has 32 divisors (see below), whose sum is σ = 26936053361280. Its totient is φ = 2693605335984.
The previous prime is 10101020010187. The next prime is 10101020010247. The reversal of 10101020010210 is 1201002010101.
It is a happy number.
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 = 10101020010192 and 10101020010201.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18705592342 + ... + 18705592881.
It is an arithmetic number, because the mean of its divisors is an integer number (841751667540).
Almost surely, 210101020010210 is an apocalyptic number.
10101020010210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10101020010210 is an abundant number, since it is smaller than the sum of its proper divisors (16835033351070).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10101020010210 is a wasteful number, since it uses less digits than its factorization.
10101020010210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37411185239 (or 37411185233 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10101020010210 its reverse (1201002010101), we get a palindrome (11302022020311).
The spelling of 10101020010210 in words is "ten trillion, one hundred one billion, twenty million, ten thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •