Base | Representation |
---|---|
bin | 11101101000010100011111… |
… | …000110000110100101100101 |
3 | 122002101220112101112021021022 |
4 | 131220110133012012211211 |
5 | 114040031311322441402 |
6 | 1141053252102300525 |
7 | 36306612325220363 |
oct | 3550243706064545 |
9 | 562356471467238 |
10 | 130314124421477 |
11 | 38581a00a54427 |
12 | 12747900727745 |
13 | 5793752707229 |
14 | 2427347124633 |
15 | 100eb81c662a2 |
hex | 76851f186965 |
130314124421477 has 2 divisors, whose sum is σ = 130314124421478. Its totient is φ = 130314124421476.
The previous prime is 130314124421471. The next prime is 130314124421489. The reversal of 130314124421477 is 774124421413031.
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., 128009515028641 + 2304609392836 = 11314129^2 + 1518094^2 .
It is a cyclic number.
It is not a de Polignac number, because 130314124421477 - 26 = 130314124421413 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130314124421471) 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, 65157062210738 + 65157062210739.
It is an arithmetic number, because the mean of its divisors is an integer number (65157062210739).
Almost surely, 2130314124421477 is an apocalyptic number.
It is an amenable number.
130314124421477 is a deficient number, since it is larger than the sum of its proper divisors (1).
130314124421477 is an equidigital number, since it uses as much as digits as its factorization.
130314124421477 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 451584, while the sum is 44.
The spelling of 130314124421477 in words is "one hundred thirty trillion, three hundred fourteen billion, one hundred twenty-four million, four hundred twenty-one thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •