Base | Representation |
---|---|
bin | 101111000010101100… |
… | …0110011100100010010 |
3 | 100122202101221102120210 |
4 | 1132011120303210102 |
5 | 3123343130321320 |
6 | 114224154344550 |
7 | 10204264565544 |
oct | 1360530634422 |
9 | 318671842523 |
10 | 101022120210 |
11 | 39930398150 |
12 | 176b412b156 |
13 | 96ac4c30bb |
14 | 4c64ac9694 |
15 | 2963d3a0e0 |
hex | 1785633912 |
101022120210 has 32 divisors (see below), whose sum is σ = 264494279232. Its totient is φ = 24490210880.
The previous prime is 101022120193. The next prime is 101022120217. The reversal of 101022120210 is 12021220101.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (101022120217) 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, 153063489 + ... + 153064148.
It is an arithmetic number, because the mean of its divisors is an integer number (8265446226).
Almost surely, 2101022120210 is an apocalyptic number.
101022120210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101022120210 is an abundant number, since it is smaller than the sum of its proper divisors (163472159022).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101022120210 is a wasteful number, since it uses less digits than its factorization.
101022120210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 306127658.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 101022120210 its reverse (12021220101), we get a palindrome (113043340311).
It can be divided in two parts, 10102 and 2120210, that added together give a palindrome (2130312).
The spelling of 101022120210 in words is "one hundred one billion, twenty-two million, one hundred twenty thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •