Base | Representation |
---|---|
bin | 1011001100100010110011… |
… | …1011101101010101011101 |
3 | 1121120211121010121112210021 |
4 | 2303020230323231111131 |
5 | 3103142121302320104 |
6 | 42103110134512141 |
7 | 2410243333360450 |
oct | 263105473552535 |
9 | 47524533545707 |
10 | 12310130120029 |
11 | 3a1677358a225 |
12 | 1469951805651 |
13 | 6b3ac0166c51 |
14 | 307b56275497 |
15 | 165334ae1754 |
hex | b322ceed55d |
12310130120029 has 8 divisors (see below), whose sum is σ = 14200203503808. Its totient is φ = 10452927577920.
The previous prime is 12310130120023. The next prime is 12310130120033. The reversal of 12310130120029 is 92002103101321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12310130120029 - 213 = 12310130111837 is a prime.
It is a super-3 number, since 3×123101301200293 (a number of 40 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12310130119985 and 12310130120012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12310130120023) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8217709612 + ... + 8217711109.
It is an arithmetic number, because the mean of its divisors is an integer number (1775025437976).
Almost surely, 212310130120029 is an apocalyptic number.
It is an amenable number.
12310130120029 is a deficient number, since it is larger than the sum of its proper divisors (1890073383779).
12310130120029 is a wasteful number, since it uses less digits than its factorization.
12310130120029 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16435420835.
The product of its (nonzero) digits is 648, while the sum is 25.
The spelling of 12310130120029 in words is "twelve trillion, three hundred ten billion, one hundred thirty million, one hundred twenty thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •