Base | Representation |
---|---|
bin | 10110100101011011… |
… | …10101101101100000 |
3 | 1011022000122021102020 |
4 | 23102231311231200 |
5 | 144313020311212 |
6 | 5323100221440 |
7 | 606321133311 |
oct | 132255655540 |
9 | 34260567366 |
10 | 12125166432 |
11 | 5162382005 |
12 | 242483a880 |
13 | 11b307a1c2 |
14 | 8304c0608 |
15 | 4ae746d8c |
hex | 2d2b75b60 |
12125166432 has 48 divisors (see below), whose sum is σ = 32276869632. Its totient is φ = 3984794240.
The previous prime is 12125166421. The next prime is 12125166433. The reversal of 12125166432 is 23466152121.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×121251664322 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12125166393 and 12125166402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12125166433) 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, 882648 + ... + 896279.
It is an arithmetic number, because the mean of its divisors is an integer number (672434784).
Almost surely, 212125166432 is an apocalyptic number.
12125166432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12125166432 is an abundant number, since it is smaller than the sum of its proper divisors (20151703200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12125166432 is a wasteful number, since it uses less digits than its factorization.
12125166432 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1779011 (or 1779003 counting only the distinct ones).
The product of its digits is 17280, while the sum is 33.
The spelling of 12125166432 in words is "twelve billion, one hundred twenty-five million, one hundred sixty-six thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •