Base | Representation |
---|---|
bin | 1100001111000011110… |
… | …1100111001000101010 |
3 | 202002120021110220222020 |
4 | 3003300331213020222 |
5 | 11420442441110010 |
6 | 240322015205310 |
7 | 21120656660421 |
oct | 3036075471052 |
9 | 662507426866 |
10 | 210201113130 |
11 | 81167059508 |
12 | 348a3b16836 |
13 | 16a8b8934a8 |
14 | a260c362b8 |
15 | 5703d0b470 |
hex | 30f0f6722a |
210201113130 has 32 divisors (see below), whose sum is σ = 504508435200. Its totient is φ = 56050767552.
The previous prime is 210201113093. The next prime is 210201113147. The reversal of 210201113130 is 31311102012.
It is a happy number.
210201113130 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×2102011131302 (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 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, 455151 + ... + 792189.
It is an arithmetic number, because the mean of its divisors is an integer number (15765888600).
Almost surely, 2210201113130 is an apocalyptic number.
210201113130 is an abundant number, since it is smaller than the sum of its proper divisors (294307322070).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210201113130 is a wasteful number, since it uses less digits than its factorization.
210201113130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 357838.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 210201113130 its reverse (31311102012), we get a palindrome (241512215142).
The spelling of 210201113130 in words is "two hundred ten billion, two hundred one million, one hundred thirteen thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •