Base | Representation |
---|---|
bin | 1110111101101… |
… | …11101010111001 |
3 | 22202012201201002 |
4 | 13132313222321 |
5 | 224114022412 |
6 | 20242334345 |
7 | 3053004002 |
oct | 736675271 |
9 | 282181632 |
10 | 125532857 |
11 | 6495076a |
12 | 3605a3b5 |
13 | 200133c8 |
14 | 1295a1a9 |
15 | b049dc2 |
hex | 77b7ab9 |
125532857 has 16 divisors (see below), whose sum is σ = 133593600. Its totient is φ = 117763200.
The previous prime is 125532853. The next prime is 125532863. The reversal of 125532857 is 758235521.
It is a cyclic number.
It is not a de Polignac number, because 125532857 - 22 = 125532853 is a prime.
It is a Smith number, since the sum of its digits (38) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
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 125532857.
It is not an unprimeable number, because it can be changed into a prime (125532853) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 359519 + ... + 359867.
It is an arithmetic number, because the mean of its divisors is an integer number (8349600).
Almost surely, 2125532857 is an apocalyptic number.
It is an amenable number.
125532857 is a deficient number, since it is larger than the sum of its proper divisors (8060743).
125532857 is a wasteful number, since it uses less digits than its factorization.
125532857 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 704.
The product of its digits is 84000, while the sum is 38.
The square root of 125532857 is about 11204.1446349108. The cubic root of 125532857 is about 500.7094688318.
The spelling of 125532857 in words is "one hundred twenty-five million, five hundred thirty-two thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •