Base | Representation |
---|---|
bin | 10110010110101101… |
… | …00100000110010111 |
3 | 1010222102011200201001 |
4 | 23023112210012113 |
5 | 144034403440341 |
6 | 5302524244131 |
7 | 603261060544 |
oct | 131326440627 |
9 | 33872150631 |
10 | 12001624471 |
11 | 50a9671111 |
12 | 23ab3a0647 |
13 | 11935b3055 |
14 | 81bd21bcb |
15 | 4a3991d31 |
hex | 2cb5a4197 |
12001624471 has 4 divisors (see below), whose sum is σ = 12001869000. Its totient is φ = 12001379944.
The previous prime is 12001624421. The next prime is 12001624477. The reversal of 12001624471 is 17442610021.
12001624471 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12001624471 - 225 = 11968070039 is a prime.
It is a super-3 number, since 3×120016244713 (a number of 31 digits) contains 333 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 (12001624477) 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 3 ways as a sum of consecutive naturals, for example, 20296 + ... + 156253.
It is an arithmetic number, because the mean of its divisors is an integer number (3000467250).
Almost surely, 212001624471 is an apocalyptic number.
12001624471 is a deficient number, since it is larger than the sum of its proper divisors (244529).
12001624471 is an equidigital number, since it uses as much as digits as its factorization.
12001624471 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 244528.
The product of its (nonzero) digits is 2688, while the sum is 28.
The spelling of 12001624471 in words is "twelve billion, one million, six hundred twenty-four thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •