Base | Representation |
---|---|
bin | 111100110010101110… |
… | …1000111100111011011 |
3 | 110110222100000121202022 |
4 | 1321211131013213123 |
5 | 4114332043313232 |
6 | 135550244125055 |
7 | 12301115321531 |
oct | 1714535074733 |
9 | 413870017668 |
10 | 130551151067 |
11 | 504037a3087 |
12 | 2137539678b |
13 | c407128c1c |
14 | 6466778151 |
15 | 35e1432812 |
hex | 1e657479db |
130551151067 has 2 divisors, whose sum is σ = 130551151068. Its totient is φ = 130551151066.
The previous prime is 130551151033. The next prime is 130551151103. The reversal of 130551151067 is 760151155031.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 130551151067 - 210 = 130551150043 is a prime.
It is not a weakly prime, because it can be changed into another prime (130553151067) 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, 65275575533 + 65275575534.
It is an arithmetic number, because the mean of its divisors is an integer number (65275575534).
Almost surely, 2130551151067 is an apocalyptic number.
130551151067 is a deficient number, since it is larger than the sum of its proper divisors (1).
130551151067 is an equidigital number, since it uses as much as digits as its factorization.
130551151067 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15750, while the sum is 35.
The spelling of 130551151067 in words is "one hundred thirty billion, five hundred fifty-one million, one hundred fifty-one thousand, sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •