Base | Representation |
---|---|
bin | 111010010001001000… |
… | …1110101100010000001 |
3 | 102221222110120120011210 |
4 | 1310202101311202001 |
5 | 4022231030341031 |
6 | 133252240000333 |
7 | 12016550151123 |
oct | 1644221654201 |
9 | 387873516153 |
10 | 125129152641 |
11 | 49081165449 |
12 | 203016000a9 |
13 | ba51a25b2c |
14 | 60b0627213 |
15 | 33c541e746 |
hex | 1d22475881 |
125129152641 has 4 divisors (see below), whose sum is σ = 166838870192. Its totient is φ = 83419435092.
The previous prime is 125129152639. The next prime is 125129152669. The reversal of 125129152641 is 146251921521.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 125129152641 - 21 = 125129152639 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 125129152641.
It is not an unprimeable number, because it can be changed into a prime (125129152241) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20854858771 + ... + 20854858776.
It is an arithmetic number, because the mean of its divisors is an integer number (41709717548).
Almost surely, 2125129152641 is an apocalyptic number.
It is an amenable number.
125129152641 is a deficient number, since it is larger than the sum of its proper divisors (41709717551).
125129152641 is an equidigital number, since it uses as much as digits as its factorization.
125129152641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41709717550.
The product of its digits is 43200, while the sum is 39.
The spelling of 125129152641 in words is "one hundred twenty-five billion, one hundred twenty-nine million, one hundred fifty-two thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •