Base | Representation |
---|---|
bin | 11100011011110001010011… |
… | …010010100011101101010000 |
3 | 121101210000100221100221221110 |
4 | 130123301103102203231100 |
5 | 112342334401240222422 |
6 | 1121544505524053320 |
7 | 35224554254256606 |
oct | 3433612322435520 |
9 | 541700327327843 |
10 | 125053665164112 |
11 | 36933a6392a873 |
12 | 120382a3534240 |
13 | 54a16826a83c9 |
14 | 22c48b5c19876 |
15 | e6cded3a160c |
hex | 71bc534a3b50 |
125053665164112 has 40 divisors (see below), whose sum is σ = 329150684731104. Its totient is φ = 40898054015104.
The previous prime is 125053665164111. The next prime is 125053665164171. The reversal of 125053665164112 is 211461566350521.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125053665164111) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 24578154918 + ... + 24578160005.
Almost surely, 2125053665164112 is an apocalyptic number.
125053665164112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
125053665164112 is an abundant number, since it is smaller than the sum of its proper divisors (204097019566992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125053665164112 is a wasteful number, since it uses less digits than its factorization.
125053665164112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49156314987 (or 49156314981 counting only the distinct ones).
The product of its (nonzero) digits is 1296000, while the sum is 48.
The spelling of 125053665164112 in words is "one hundred twenty-five trillion, fifty-three billion, six hundred sixty-five million, one hundred sixty-four thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •