Base | Representation |
---|---|
bin | 111010010001011100… |
… | …0000010100110000000 |
3 | 102222000011102101010210 |
4 | 1310202320002212000 |
5 | 4022241111330431 |
6 | 133253234354120 |
7 | 12020031242241 |
oct | 1644270024600 |
9 | 388004371123 |
10 | 125139167616 |
11 | 49086885891 |
12 | 20304a2b940 |
13 | ba53b21458 |
14 | 60b1ab2cc8 |
15 | 33c624bd46 |
hex | 1d22e02980 |
125139167616 has 32 divisors (see below), whose sum is σ = 332400915000. Its totient is φ = 41713055744.
The previous prime is 125139167603. The next prime is 125139167623. The reversal of 125139167616 is 616761931521.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (32).
It is a super-2 number, since 2×1251391676162 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 162941241 + ... + 162942008.
Almost surely, 2125139167616 is an apocalyptic number.
125139167616 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
125139167616 is an abundant number, since it is smaller than the sum of its proper divisors (207261747384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125139167616 is an equidigital number, since it uses as much as digits as its factorization.
125139167616 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 325883266 (or 325883254 counting only the distinct ones).
The product of its digits is 408240, while the sum is 48.
The spelling of 125139167616 in words is "one hundred twenty-five billion, one hundred thirty-nine million, one hundred sixty-seven thousand, six hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •