Base | Representation |
---|---|
bin | 11101101000011100000010… |
… | …001110011011110110000011 |
3 | 122002102200110021121101002022 |
4 | 131220130002032123312003 |
5 | 114040144411340013102 |
6 | 1141101112253112055 |
7 | 36310320230421551 |
oct | 3550340216336603 |
9 | 562380407541068 |
10 | 130322230001027 |
11 | 385853903842a9 |
12 | 127493a318862b |
13 | 5794444a9564c |
14 | 24278b5832bd1 |
15 | 100eea86695a2 |
hex | 76870239bd83 |
130322230001027 has 2 divisors, whose sum is σ = 130322230001028. Its totient is φ = 130322230001026.
The previous prime is 130322230000993. The next prime is 130322230001059. The reversal of 130322230001027 is 720100032223031.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 130322230001027 - 220 = 130322228952451 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130322230000987 and 130322230001005.
It is not a weakly prime, because it can be changed into another prime (130322220001027) 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, 65161115000513 + 65161115000514.
It is an arithmetic number, because the mean of its divisors is an integer number (65161115000514).
Almost surely, 2130322230001027 is an apocalyptic number.
130322230001027 is a deficient number, since it is larger than the sum of its proper divisors (1).
130322230001027 is an equidigital number, since it uses as much as digits as its factorization.
130322230001027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3024, while the sum is 26.
Adding to 130322230001027 its reverse (720100032223031), we get a palindrome (850422262224058).
The spelling of 130322230001027 in words is "one hundred thirty trillion, three hundred twenty-two billion, two hundred thirty million, one thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •