Base | Representation |
---|---|
bin | 1011101101100110101… |
… | …0100100010001110010 |
3 | 201020101101111212021220 |
4 | 2323121222210101302 |
5 | 11244044344411010 |
6 | 232234521325510 |
7 | 20352266262330 |
oct | 2733152442162 |
9 | 636341455256 |
10 | 201220310130 |
11 | 7837868a274 |
12 | 32bb8336896 |
13 | 15c8a0a4c88 |
14 | 9a4c1bab50 |
15 | 537a672970 |
hex | 2ed9aa4472 |
201220310130 has 32 divisors (see below), whose sum is σ = 551918565504. Its totient is φ = 45993213696.
The previous prime is 201220310099. The next prime is 201220310143. The reversal of 201220310130 is 31013022102.
201220310130 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2012203101302 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 479095767 + ... + 479096186.
It is an arithmetic number, because the mean of its divisors is an integer number (17247455172).
Almost surely, 2201220310130 is an apocalyptic number.
201220310130 is an abundant number, since it is smaller than the sum of its proper divisors (350698255374).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201220310130 is a wasteful number, since it uses less digits than its factorization.
201220310130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 958191970.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 201220310130 its reverse (31013022102), we get a palindrome (232233332232).
The spelling of 201220310130 in words is "two hundred one billion, two hundred twenty million, three hundred ten thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •