Base | Representation |
---|---|
bin | 111010001101101000… |
… | …0101110100011100101 |
3 | 102221200021001012021221 |
4 | 1310123100232203211 |
5 | 4022010410441123 |
6 | 133232432340341 |
7 | 12013620356314 |
oct | 1643320564345 |
9 | 387607035257 |
10 | 125011421413 |
11 | 4902076320a |
12 | 2028a0a46b1 |
13 | ba33514798 |
14 | 609cb3c27b |
15 | 33b9e1625d |
hex | 1d1b42e8e5 |
125011421413 has 2 divisors, whose sum is σ = 125011421414. Its totient is φ = 125011421412.
The previous prime is 125011421411. The next prime is 125011421461. The reversal of 125011421413 is 314124110521.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 119561733729 + 5449687684 = 345777^2 + 73822^2 .
It is a cyclic number.
It is not a de Polignac number, because 125011421413 - 21 = 125011421411 is a prime.
Together with 125011421411, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (125011421411) 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 as a sum of consecutive naturals, namely, 62505710706 + 62505710707.
It is an arithmetic number, because the mean of its divisors is an integer number (62505710707).
Almost surely, 2125011421413 is an apocalyptic number.
It is an amenable number.
125011421413 is a deficient number, since it is larger than the sum of its proper divisors (1).
125011421413 is an equidigital number, since it uses as much as digits as its factorization.
125011421413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 960, while the sum is 25.
Adding to 125011421413 its reverse (314124110521), we get a palindrome (439135531934).
The spelling of 125011421413 in words is "one hundred twenty-five billion, eleven million, four hundred twenty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •