Base | Representation |
---|---|
bin | 111010011010110010… |
… | …1001000011001010001 |
3 | 102222211000220120201011 |
4 | 1310311211020121101 |
5 | 4023411430241440 |
6 | 133344324410521 |
7 | 12030561500464 |
oct | 1646545103121 |
9 | 388730816634 |
10 | 125452977745 |
11 | 49227a31aa7 |
12 | 20391b46a41 |
13 | baa3b46114 |
14 | 610163d2db |
15 | 33e3a879ea |
hex | 1d35948651 |
125452977745 has 8 divisors (see below), whose sum is σ = 150604463016. Its totient is φ = 100321789056.
The previous prime is 125452977737. The next prime is 125452977787. The reversal of 125452977745 is 547779254521.
It can be written as a sum of positive squares in 4 ways, for example, as 1437016464 + 124015961281 = 37908^2 + 352159^2 .
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 125452977745 - 23 = 125452977737 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 125452977745.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5060542 + ... + 5085271.
It is an arithmetic number, because the mean of its divisors is an integer number (18825557877).
Almost surely, 2125452977745 is an apocalyptic number.
It is an amenable number.
125452977745 is a deficient number, since it is larger than the sum of its proper divisors (25151485271).
125452977745 is a wasteful number, since it uses less digits than its factorization.
125452977745 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10148291.
The product of its digits is 24696000, while the sum is 58.
The spelling of 125452977745 in words is "one hundred twenty-five billion, four hundred fifty-two million, nine hundred seventy-seven thousand, seven hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •