Base | Representation |
---|---|
bin | 10110010111111101… |
… | …11010000001100000 |
3 | 1011000011001222122111 |
4 | 23023332322001200 |
5 | 144100110400112 |
6 | 5303543045104 |
7 | 603450005230 |
oct | 131376720140 |
9 | 34004058574 |
10 | 12012200032 |
11 | 5104634748 |
12 | 23b2a40794 |
13 | 1195846891 |
14 | 81d4b5cc0 |
15 | 4a48805a7 |
hex | 2cbfba060 |
12012200032 has 48 divisors (see below), whose sum is σ = 27470554272. Its totient is φ = 5063685120.
The previous prime is 12012200029. The next prime is 12012200033. The reversal of 12012200032 is 23000221021.
12012200032 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 12012199985 and 12012200021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12012200033) 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 7 ways as a sum of consecutive naturals, for example, 425893 + ... + 453220.
It is an arithmetic number, because the mean of its divisors is an integer number (572303214).
Almost surely, 212012200032 is an apocalyptic number.
It is an amenable number.
12012200032 is an abundant number, since it is smaller than the sum of its proper divisors (15458354240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12012200032 is an equidigital number, since it uses as much as digits as its factorization.
12012200032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 879191 (or 879183 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 12012200032 its reverse (23000221021), we get a palindrome (35012421053).
The spelling of 12012200032 in words is "twelve billion, twelve million, two hundred thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •