Base | Representation |
---|---|
bin | 111100110010110100… |
… | …0111000000100101001 |
3 | 110110222112211012112202 |
4 | 1321211220320010221 |
5 | 4114333340430004 |
6 | 135550434145545 |
7 | 12301153446245 |
oct | 1714550700451 |
9 | 413875735482 |
10 | 130554233129 |
11 | 50405508741 |
12 | 213764222b5 |
13 | c407967a28 |
14 | 6466d3b425 |
15 | 35e1840b1e |
hex | 1e65a38129 |
130554233129 has 2 divisors, whose sum is σ = 130554233130. Its totient is φ = 130554233128.
The previous prime is 130554233087. The next prime is 130554233153. The reversal of 130554233129 is 921332455031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 124210429225 + 6343803904 = 352435^2 + 79648^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130554233129 is a prime.
It is a super-2 number, since 2×1305542331292 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130554233092 and 130554233101.
It is not a weakly prime, because it can be changed into another prime (130554233179) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65277116564 + 65277116565.
It is an arithmetic number, because the mean of its divisors is an integer number (65277116565).
Almost surely, 2130554233129 is an apocalyptic number.
It is an amenable number.
130554233129 is a deficient number, since it is larger than the sum of its proper divisors (1).
130554233129 is an equidigital number, since it uses as much as digits as its factorization.
130554233129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 97200, while the sum is 38.
The spelling of 130554233129 in words is "one hundred thirty billion, five hundred fifty-four million, two hundred thirty-three thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •