Base | Representation |
---|---|
bin | 1011010011100001111110… |
… | …1000110100110101110000 |
3 | 1122000022102122120200211001 |
4 | 2310320133220310311300 |
5 | 3112123440013304022 |
6 | 42234201155331344 |
7 | 2422023050656135 |
oct | 264703750646560 |
9 | 48008378520731 |
10 | 12430166150512 |
11 | 3a62670813600 |
12 | 14890715b0b54 |
13 | 6c220c958116 |
14 | 30d8a22ba58c |
15 | 16850cd12b27 |
hex | b4e1fa34d70 |
12430166150512 has 120 divisors (see below), whose sum is σ = 27933217472160. Its totient is φ = 5343694540800.
The previous prime is 12430166150509. The next prime is 12430166150531. The reversal of 12430166150512 is 21505166103421.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2394712 + ... + 5531272.
It is an arithmetic number, because the mean of its divisors is an integer number (232776812268).
Almost surely, 212430166150512 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12430166150512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13966608736080).
12430166150512 is an abundant number, since it is smaller than the sum of its proper divisors (15503051321648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12430166150512 is a wasteful number, since it uses less digits than its factorization.
12430166150512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3136703 (or 3136686 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 37.
The spelling of 12430166150512 in words is "twelve trillion, four hundred thirty billion, one hundred sixty-six million, one hundred fifty thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •