Base | Representation |
---|---|
bin | 10110011000000111… |
… | …00111011001001000 |
3 | 1011000020101200221022 |
4 | 23030003213121020 |
5 | 144100414400230 |
6 | 5304025332012 |
7 | 603463336130 |
oct | 131403473110 |
9 | 34006350838 |
10 | 12013434440 |
11 | 51052a8117 |
12 | 23b3337008 |
13 | 1195b896b7 |
14 | 81d717ac0 |
15 | 4a4a261e5 |
hex | 2cc0e7648 |
12013434440 has 64 divisors (see below), whose sum is σ = 31956940800. Its totient is φ = 3976858368.
The previous prime is 12013434431. The next prime is 12013434449. The reversal of 12013434440 is 4443431021.
It is an interprime number because it is at equal distance from previous prime (12013434431) and next prime (12013434449).
It is a super-2 number, since 2×120134344402 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (12013434449) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 731624 + ... + 747863.
It is an arithmetic number, because the mean of its divisors is an integer number (499327200).
Almost surely, 212013434440 is an apocalyptic number.
12013434440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12013434440 is an abundant number, since it is smaller than the sum of its proper divisors (19943506360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12013434440 is a wasteful number, since it uses less digits than its factorization.
12013434440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1479534 (or 1479530 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 12013434440 its reverse (4443431021), we get a palindrome (16456865461).
The spelling of 12013434440 in words is "twelve billion, thirteen million, four hundred thirty-four thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •