Base | Representation |
---|---|
bin | 10010101111110110… |
… | …101000011001100000 |
3 | 1220221220112021111200 |
4 | 102233312220121200 |
5 | 312211313000412 |
6 | 13125300041200 |
7 | 1311562622106 |
oct | 225766503140 |
9 | 56856467450 |
10 | 20130203232 |
11 | 859aa7a6a7 |
12 | 3a99693200 |
13 | 1b8a664a79 |
14 | d8d6d9c76 |
15 | 7cc3d99dc |
hex | 4afda8660 |
20130203232 has 72 divisors (see below), whose sum is σ = 57306871440. Its totient is φ = 6702846720.
The previous prime is 20130203207. The next prime is 20130203273. The reversal of 20130203232 is 23230203102.
It is a happy number.
20130203232 is a `hidden beast` number, since 201 + 30 + 203 + 232 = 666.
It is a tau number, because it is divible by the number of its divisors (72).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 233869 + ... + 308147.
It is an arithmetic number, because the mean of its divisors is an integer number (795928770).
Almost surely, 220130203232 is an apocalyptic number.
It is an amenable number.
20130203232 is an abundant number, since it is smaller than the sum of its proper divisors (37176668208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20130203232 is a wasteful number, since it uses less digits than its factorization.
20130203232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75236 (or 75225 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 18.
Adding to 20130203232 its reverse (23230203102), we get a palindrome (43360406334).
The spelling of 20130203232 in words is "twenty billion, one hundred thirty million, two hundred three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •