Base | Representation |
---|---|
bin | 10110011010010100… |
… | …11110100000111100 |
3 | 1011001112100110020010 |
4 | 23031022132200330 |
5 | 144120143312200 |
6 | 5305531423220 |
7 | 604110254142 |
oct | 131512364074 |
9 | 34045313203 |
10 | 12032010300 |
11 | 5114835472 |
12 | 23b95b4b10 |
13 | 119999182b |
14 | 821d91592 |
15 | 4a6495150 |
hex | 2cd29e83c |
12032010300 has 72 divisors (see below), whose sum is σ = 36644876800. Its totient is φ = 3039664320.
The previous prime is 12032010283. The next prime is 12032010301. The reversal of 12032010300 is 301023021.
It is a happy number.
12032010300 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12032010301) 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 23 ways as a sum of consecutive naturals, for example, 1049740 + ... + 1061139.
Almost surely, 212032010300 is an apocalyptic number.
12032010300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12032010300 is an abundant number, since it is smaller than the sum of its proper divisors (24612866500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12032010300 is a wasteful number, since it uses less digits than its factorization.
12032010300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2110915 (or 2110908 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 12032010300 its reverse (301023021), we get a palindrome (12333033321).
The spelling of 12032010300 in words is "twelve billion, thirty-two million, ten thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •