Base | Representation |
---|---|
bin | 111010100011110110… |
… | …1000010110110011011 |
3 | 110000121020001122120000 |
4 | 1311013231002312123 |
5 | 4030022300321300 |
6 | 133434425504043 |
7 | 12041243135430 |
oct | 1650755026633 |
9 | 400536048500 |
10 | 125757042075 |
11 | 49373632035 |
12 | 20457942023 |
13 | bb21b37b42 |
14 | 612db8db87 |
15 | 34105eac00 |
hex | 1d47b42d9b |
125757042075 has 240 divisors, whose sum is σ = 274603448064. Its totient is φ = 55693267200.
The previous prime is 125757042067. The next prime is 125757042121. The reversal of 125757042075 is 570240757521.
125757042075 is a `hidden beast` number, since 1 + 2 + 5 + 7 + 570 + 4 + 2 + 0 + 75 = 666.
It is not a de Polignac number, because 125757042075 - 23 = 125757042067 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 125757042075.
It is an unprimeable number.
It is a polite number, since it can be written in 239 ways as a sum of consecutive naturals, for example, 181992480 + ... + 181993170.
Almost surely, 2125757042075 is an apocalyptic number.
125757042075 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
125757042075 is an abundant number, since it is smaller than the sum of its proper divisors (148846405989).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125757042075 is a wasteful number, since it uses less digits than its factorization.
125757042075 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1104 (or 1090 counting only the distinct ones).
The product of its (nonzero) digits is 686000, while the sum is 45.
Adding to 125757042075 its reverse (570240757521), we get a palindrome (695997799596).
The spelling of 125757042075 in words is "one hundred twenty-five billion, seven hundred fifty-seven million, forty-two thousand, seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.038 sec. • engine limits •