Base | Representation |
---|---|
bin | 111010101000101111… |
… | …0110100101110111101 |
3 | 110001000122201222001122 |
4 | 1311101132310232331 |
5 | 4030341244231042 |
6 | 133503005520325 |
7 | 12045304400651 |
oct | 1652136645675 |
9 | 401018658048 |
10 | 125921086397 |
11 | 49448196a57 |
12 | 204a28730a5 |
13 | bb49b133a2 |
14 | 6147892a61 |
15 | 341ec017d2 |
hex | 1d517b4bbd |
125921086397 has 8 divisors (see below), whose sum is σ = 130361909376. Its totient is φ = 121553665632.
The previous prime is 125921086391. The next prime is 125921086439. The reversal of 125921086397 is 793680129521.
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 125921086397 - 28 = 125921086141 is a prime.
It is a super-2 number, since 2×1259210863972 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125921086391) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18347063 + ... + 18353924.
It is an arithmetic number, because the mean of its divisors is an integer number (16295238672).
Almost surely, 2125921086397 is an apocalyptic number.
It is an amenable number.
125921086397 is a deficient number, since it is larger than the sum of its proper divisors (4440822979).
125921086397 is an equidigital number, since it uses as much as digits as its factorization.
125921086397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36701107.
The product of its (nonzero) digits is 1632960, while the sum is 53.
The spelling of 125921086397 in words is "one hundred twenty-five billion, nine hundred twenty-one million, eighty-six thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •