Base | Representation |
---|---|
bin | 1011010010000100101001… |
… | …0000111011100010100001 |
3 | 1121220220202112211201201112 |
4 | 2310201022100323202201 |
5 | 3111221132021044014 |
6 | 42214455103313105 |
7 | 2420145140662451 |
oct | 264411220734241 |
9 | 47826675751645 |
10 | 12405111503009 |
11 | 3a52a84052055 |
12 | 148423a8ab795 |
13 | 6bca48cca004 |
14 | 30c5a6989d61 |
15 | 167a4344873e |
hex | b484a43b8a1 |
12405111503009 has 6 divisors (see below), whose sum is σ = 12847624399350. Its totient is φ = 11977349036576.
The previous prime is 12405111502981. The next prime is 12405111503023. The reversal of 12405111503009 is 90030511150421.
It can be written as a sum of positive squares in 3 ways, for example, as 957174592609 + 11447936910400 = 978353^2 + 3383480^2 .
It is not a de Polignac number, because 12405111503009 - 28 = 12405111502753 is a prime.
It is a super-2 number, since 2×124051115030092 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12405111103009) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 7375214084 + ... + 7375215765.
It is an arithmetic number, because the mean of its divisors is an integer number (2141270733225).
Almost surely, 212405111503009 is an apocalyptic number.
It is an amenable number.
12405111503009 is a deficient number, since it is larger than the sum of its proper divisors (442512896341).
12405111503009 is an equidigital number, since it uses as much as digits as its factorization.
12405111503009 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14750429907 (or 14750429878 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 32.
The spelling of 12405111503009 in words is "twelve trillion, four hundred five billion, one hundred eleven million, five hundred three thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •