Base | Representation |
---|---|
bin | 11100100001011010111111… |
… | …001000010001000110110011 |
3 | 121110011010210011021000000121 |
4 | 130201122333020101012303 |
5 | 112420220224443244301 |
6 | 1122443134043231111 |
7 | 35264613142322551 |
oct | 3441327710210663 |
9 | 543133704230017 |
10 | 125442021462451 |
11 | 36a73731937831 |
12 | 1209b607218497 |
13 | 54cc193931b45 |
14 | 22d95d782abd1 |
15 | e7807c9593a1 |
hex | 7216bf2111b3 |
125442021462451 has 2 divisors, whose sum is σ = 125442021462452. Its totient is φ = 125442021462450.
The previous prime is 125442021462431. The next prime is 125442021462481. The reversal of 125442021462451 is 154264120244521.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 125442021462451 - 231 = 125439873978803 is a prime.
It is a super-3 number, since 3×1254420214624513 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 125442021462398 and 125442021462407.
It is not a weakly prime, because it can be changed into another prime (125442021462421) 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 as a sum of consecutive naturals, namely, 62721010731225 + 62721010731226.
It is an arithmetic number, because the mean of its divisors is an integer number (62721010731226).
Almost surely, 2125442021462451 is an apocalyptic number.
125442021462451 is a deficient number, since it is larger than the sum of its proper divisors (1).
125442021462451 is an equidigital number, since it uses as much as digits as its factorization.
125442021462451 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 614400, while the sum is 43.
The spelling of 125442021462451 in words is "one hundred twenty-five trillion, four hundred forty-two billion, twenty-one million, four hundred sixty-two thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •