Base | Representation |
---|---|
bin | 10110010110101001… |
… | …00101001000101111 |
3 | 1010222101012021100022 |
4 | 23023110211020233 |
5 | 144034240320211 |
6 | 5302505152355 |
7 | 603253463441 |
oct | 131324451057 |
9 | 33871167308 |
10 | 12001104431 |
11 | 50a9346428 |
12 | 23ab18b6bb |
13 | 1193460434 |
14 | 81bc28491 |
15 | 4a38dcbdb |
hex | 2cb52522f |
12001104431 has 16 divisors (see below), whose sum is σ = 12523929600. Its totient is φ = 11487044160.
The previous prime is 12001104407. The next prime is 12001104461. The reversal of 12001104431 is 13440110021.
It is a happy number.
12001104431 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 12001104431 - 210 = 12001103407 is a prime.
It is a super-2 number, since 2×120011044312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12001104461) 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 15 ways as a sum of consecutive naturals, for example, 3347666 + ... + 3351248.
It is an arithmetic number, because the mean of its divisors is an integer number (782745600).
Almost surely, 212001104431 is an apocalyptic number.
12001104431 is a deficient number, since it is larger than the sum of its proper divisors (522825169).
12001104431 is a wasteful number, since it uses less digits than its factorization.
12001104431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4766.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 12001104431 its reverse (13440110021), we get a palindrome (25441214452).
The spelling of 12001104431 in words is "twelve billion, one million, one hundred four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •