Base | Representation |
---|---|
bin | 111010011001000101… |
… | …1110101111010000001 |
3 | 102222200001201122221101 |
4 | 1310302023311322001 |
5 | 4023302340014034 |
6 | 133334531454401 |
7 | 12026300361502 |
oct | 1646213657201 |
9 | 388601648841 |
10 | 125396016769 |
11 | 491a8867411 |
12 | 20376a57401 |
13 | ba950c14ba |
14 | 60d7c52ba9 |
15 | 33dda85514 |
hex | 1d322f5e81 |
125396016769 has 9 divisors (see below), whose sum is σ = 129582878529. Its totient is φ = 121340360580.
The previous prime is 125396016761. The next prime is 125396016799. The reversal of 125396016769 is 967610693521.
The square root of 125396016769 is 354113.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 125396016769 - 23 = 125396016761 is a prime.
It is a super-2 number, since 2×1253960167692 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (125396016761) 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 8 ways as a sum of consecutive naturals, for example, 10971792 + ... + 10983214.
Almost surely, 2125396016769 is an apocalyptic number.
125396016769 is the 354113-rd square number.
125396016769 is the 177057-th centered octagonal number.
It is an amenable number.
125396016769 is a deficient number, since it is larger than the sum of its proper divisors (4186861760).
125396016769 is an frugal number, since it uses more digits than its factorization.
125396016769 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22908 (or 11454 counting only the distinct ones).
The product of its (nonzero) digits is 3674160, while the sum is 55.
The spelling of 125396016769 in words is "one hundred twenty-five billion, three hundred ninety-six million, sixteen thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •