Base | Representation |
---|---|
bin | 111010010001001110… |
… | …1010001011011111001 |
3 | 102221222200012212111101 |
4 | 1310202131101123321 |
5 | 4022232312304041 |
6 | 133252424131401 |
7 | 12016614505240 |
oct | 1644235213371 |
9 | 387880185441 |
10 | 125132150521 |
11 | 49082922834 |
12 | 20302606b61 |
13 | ba52535521 |
14 | 60b0ba7957 |
15 | 33c5812b31 |
hex | 1d227516f9 |
125132150521 has 8 divisors (see below), whose sum is σ = 150534918080. Its totient is φ = 101611069488.
The previous prime is 125132150503. The next prime is 125132150531. The reversal of 125132150521 is 125051231521.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 125132150521 - 217 = 125132019449 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 125132150521.
It is not an unprimeable number, because it can be changed into a prime (125132150531) 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, 470421486 + ... + 470421751.
It is an arithmetic number, because the mean of its divisors is an integer number (18816864760).
Almost surely, 2125132150521 is an apocalyptic number.
It is an amenable number.
125132150521 is a deficient number, since it is larger than the sum of its proper divisors (25402767559).
125132150521 is an equidigital number, since it uses as much as digits as its factorization.
125132150521 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 940843263.
The product of its (nonzero) digits is 3000, while the sum is 28.
It can be divided in two parts, 125132 and 150521, that added together give a triangular number (275653 = T742).
The spelling of 125132150521 in words is "one hundred twenty-five billion, one hundred thirty-two million, one hundred fifty thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •