Base | Representation |
---|---|
bin | 111010001110110111… |
… | …0110100001110100101 |
3 | 102221210011000200000020 |
4 | 1310131232310032211 |
5 | 4022102013112042 |
6 | 133240512505353 |
7 | 12014632541400 |
oct | 1643556641645 |
9 | 387704020006 |
10 | 125052863397 |
11 | 49042099190 |
12 | 2029bb4b259 |
13 | ba3bc94777 |
14 | 60a4448d37 |
15 | 33bd8a03ec |
hex | 1d1dbb43a5 |
125052863397 has 48 divisors (see below), whose sum is σ = 211800282624. Its totient is φ = 64898652000.
The previous prime is 125052863371. The next prime is 125052863443. The reversal of 125052863397 is 793368250521.
It is not a de Polignac number, because 125052863397 - 27 = 125052863269 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125052863357) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1629622 + ... + 1704632.
It is an arithmetic number, because the mean of its divisors is an integer number (4412505888).
Almost surely, 2125052863397 is an apocalyptic number.
It is an amenable number.
125052863397 is a deficient number, since it is larger than the sum of its proper divisors (86747419227).
125052863397 is a wasteful number, since it uses less digits than its factorization.
125052863397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76070 (or 76063 counting only the distinct ones).
The product of its (nonzero) digits is 2721600, while the sum is 51.
The spelling of 125052863397 in words is "one hundred twenty-five billion, fifty-two million, eight hundred sixty-three thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •