Base | Representation |
---|---|
bin | 1111100001000… |
… | …00010011111001 |
3 | 100001220121011001 |
4 | 13300200103321 |
5 | 231304441034 |
6 | 20525405001 |
7 | 3140206612 |
oct | 760402371 |
9 | 301817131 |
10 | 130155769 |
11 | 67518a57 |
12 | 37709761 |
13 | 20c71663 |
14 | 13400c09 |
15 | b65ea14 |
hex | 7c204f9 |
130155769 has 2 divisors, whose sum is σ = 130155770. Its totient is φ = 130155768.
The previous prime is 130155721. The next prime is 130155787. The reversal of 130155769 is 967551031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 129686544 + 469225 = 11388^2 + 685^2 .
It is a cyclic number.
It is not a de Polignac number, because 130155769 - 221 = 128058617 is a prime.
It is a super-2 number, since 2×1301557692 = 33881048407962722, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (130155169) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65077884 + 65077885.
It is an arithmetic number, because the mean of its divisors is an integer number (65077885).
Almost surely, 2130155769 is an apocalyptic number.
It is an amenable number.
130155769 is a deficient number, since it is larger than the sum of its proper divisors (1).
130155769 is an equidigital number, since it uses as much as digits as its factorization.
130155769 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28350, while the sum is 37.
The square root of 130155769 is about 11408.5831285046. The cubic root of 130155769 is about 506.7819529807.
The spelling of 130155769 in words is "one hundred thirty million, one hundred fifty-five thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •