Base | Representation |
---|---|
bin | 11100011101010011100000… |
… | …000011111011100010100100 |
3 | 121102011002112022011010011020 |
4 | 130131103200003323202210 |
5 | 112401101322132212012 |
6 | 1122105144414011140 |
7 | 35235306216563622 |
oct | 3435234003734244 |
9 | 542132468133136 |
10 | 125159106132132 |
11 | 3697475157a756 |
12 | 1205480b4a6ab0 |
13 | 54ab5b7500347 |
14 | 22c9a39728512 |
15 | e70a200e9a8c |
hex | 71d4e00fb8a4 |
125159106132132 has 12 divisors (see below), whose sum is σ = 292037914308336. Its totient is φ = 41719702044040.
The previous prime is 125159106132131. The next prime is 125159106132169. The reversal of 125159106132132 is 231231601951521.
It is a tau number, because it is divible by the number of its divisors (12).
It is not an unprimeable number, because it can be changed into a prime (125159106132131) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5214962755494 + ... + 5214962755517.
It is an arithmetic number, because the mean of its divisors is an integer number (24336492859028).
Almost surely, 2125159106132132 is an apocalyptic number.
125159106132132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
125159106132132 is an abundant number, since it is smaller than the sum of its proper divisors (166878808176204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125159106132132 is a wasteful number, since it uses less digits than its factorization.
125159106132132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10429925511018 (or 10429925511016 counting only the distinct ones).
The product of its (nonzero) digits is 97200, while the sum is 42.
The spelling of 125159106132132 in words is "one hundred twenty-five trillion, one hundred fifty-nine billion, one hundred six million, one hundred thirty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •