Base | Representation |
---|---|
bin | 11101101100010010100… |
… | …00101011011110001110 |
3 | 10121112100012021212220100 |
4 | 32312021100223132032 |
5 | 113203342241200420 |
6 | 2100402243031530 |
7 | 133464520524465 |
oct | 16661120533616 |
9 | 3545305255810 |
10 | 1020210100110 |
11 | 36373a006273 |
12 | 14588236b5a6 |
13 | 75289355a66 |
14 | 375425bd9dc |
15 | 1b810b84190 |
hex | ed8942b78e |
1020210100110 has 48 divisors (see below), whose sum is σ = 2808578397456. Its totient is φ = 256052730624.
The previous prime is 1020210100097. The next prime is 1020210100141. The reversal of 1020210100110 is 110010120201.
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 = 1020210100092 and 1020210100101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 333400464 + ... + 333403523.
It is an arithmetic number, because the mean of its divisors is an integer number (58512049947).
Almost surely, 21020210100110 is an apocalyptic number.
1020210100110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1020210100110 is an abundant number, since it is smaller than the sum of its proper divisors (1788368297346).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1020210100110 is a wasteful number, since it uses less digits than its factorization.
1020210100110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 666804017 (or 666804014 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1020210100110 its reverse (110010120201), we get a palindrome (1130220220311).
The spelling of 1020210100110 in words is "one trillion, twenty billion, two hundred ten million, one hundred thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •