Base | Representation |
---|---|
bin | 10110010111101101… |
… | …11001010101000000 |
3 | 1011000000010021222201 |
4 | 23023312321111000 |
5 | 144044041200112 |
6 | 5303430042544 |
7 | 603423110620 |
oct | 131366712500 |
9 | 34000107881 |
10 | 12010100032 |
11 | 510342aa07 |
12 | 23b21a9454 |
13 | 119528ca88 |
14 | 81d0ca880 |
15 | 4a45b8257 |
hex | 2cbdb9540 |
12010100032 has 56 divisors (see below), whose sum is σ = 28670747840. Its totient is φ = 4876277760.
The previous prime is 12010100027. The next prime is 12010100077. The reversal of 12010100032 is 23000101021.
12010100032 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (56).
It is a junction number, because it is equal to n+sod(n) for n = 12010099991 and 12010100018.
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 7 ways as a sum of consecutive naturals, for example, 696969 + ... + 713992.
It is an arithmetic number, because the mean of its divisors is an integer number (511977640).
Almost surely, 212010100032 is an apocalyptic number.
It is an amenable number.
12010100032 is an abundant number, since it is smaller than the sum of its proper divisors (16660647808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12010100032 is a wasteful number, since it uses less digits than its factorization.
12010100032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1410999 (or 1410989 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 12010100032 its reverse (23000101021), we get a palindrome (35010201053).
The spelling of 12010100032 in words is "twelve billion, ten million, one hundred thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •