Base | Representation |
---|---|
bin | 111010001111001101… |
… | …0100010001010011101 |
3 | 102221210221120220122102 |
4 | 1310132122202022131 |
5 | 4022112431324431 |
6 | 133242002254445 |
7 | 12015132132440 |
oct | 1643632421235 |
9 | 387727526572 |
10 | 125064323741 |
11 | 49048606545 |
12 | 202a3957425 |
13 | ba41477c36 |
14 | 60a5b8d657 |
15 | 33be8b5dcb |
hex | 1d1e6a229d |
125064323741 has 4 divisors (see below), whose sum is σ = 142930655712. Its totient is φ = 107197991772.
The previous prime is 125064323707. The next prime is 125064323743. The reversal of 125064323741 is 147323460521.
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 a cyclic number.
It is not a de Polignac number, because 125064323741 - 210 = 125064322717 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 125064323695 and 125064323704.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125064323743) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8933165975 + ... + 8933165988.
It is an arithmetic number, because the mean of its divisors is an integer number (35732663928).
Almost surely, 2125064323741 is an apocalyptic number.
It is an amenable number.
125064323741 is a deficient number, since it is larger than the sum of its proper divisors (17866331971).
125064323741 is an equidigital number, since it uses as much as digits as its factorization.
125064323741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17866331970.
The product of its (nonzero) digits is 120960, while the sum is 38.
The spelling of 125064323741 in words is "one hundred twenty-five billion, sixty-four million, three hundred twenty-three thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •