Base | Representation |
---|---|
bin | 111010100011111000… |
… | …1110011111010011001 |
3 | 110000121022102010121001 |
4 | 1311013301303322121 |
5 | 4030023110312414 |
6 | 133434512345001 |
7 | 12041256561406 |
oct | 1650761637231 |
9 | 400538363531 |
10 | 125758291609 |
11 | 49374305905 |
12 | 20458245161 |
13 | bb22184802 |
14 | 612ddd72ad |
15 | 3410796074 |
hex | 1d47c73e99 |
125758291609 has 4 divisors (see below), whose sum is σ = 127635281104. Its totient is φ = 123881302116.
The previous prime is 125758291591. The next prime is 125758291613. The reversal of 125758291609 is 906192857521.
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, and also an emirpimes, since its reverse is a distinct semiprime: 906192857521 = 7 ⋅129456122503.
It is a cyclic number.
It is not a de Polignac number, because 125758291609 - 29 = 125758291097 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 125758291609.
It is not an unprimeable number, because it can be changed into a prime (125758391609) 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, 938494647 + ... + 938494780.
It is an arithmetic number, because the mean of its divisors is an integer number (31908820276).
Almost surely, 2125758291609 is an apocalyptic number.
It is an amenable number.
125758291609 is a deficient number, since it is larger than the sum of its proper divisors (1876989495).
125758291609 is an equidigital number, since it uses as much as digits as its factorization.
125758291609 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1876989494.
The product of its (nonzero) digits is 2721600, while the sum is 55.
The spelling of 125758291609 in words is "one hundred twenty-five billion, seven hundred fifty-eight million, two hundred ninety-one thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •