Base | Representation |
---|---|
bin | 111100111010100111… |
… | …0011110111010011101 |
3 | 110111122202220121221222 |
4 | 1321311032132322131 |
5 | 4120402312443124 |
6 | 140032415303125 |
7 | 12310510345424 |
oct | 1716516367235 |
9 | 414582817858 |
10 | 130815749789 |
11 | 5052a09800a |
12 | 21429b1aaa5 |
13 | c449bb040a |
14 | 648d9742bb |
15 | 360979c25e |
hex | 1e7539ee9d |
130815749789 has 2 divisors, whose sum is σ = 130815749790. Its totient is φ = 130815749788.
The previous prime is 130815749773. The next prime is 130815749791. The reversal of 130815749789 is 987947518031.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 128099568100 + 2716181689 = 357910^2 + 52117^2 .
It is a cyclic number.
It is not a de Polignac number, because 130815749789 - 24 = 130815749773 is a prime.
It is a super-2 number, since 2×1308157497892 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 130815749791, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130815769789) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65407874894 + 65407874895.
It is an arithmetic number, because the mean of its divisors is an integer number (65407874895).
Almost surely, 2130815749789 is an apocalyptic number.
It is an amenable number.
130815749789 is a deficient number, since it is larger than the sum of its proper divisors (1).
130815749789 is an equidigital number, since it uses as much as digits as its factorization.
130815749789 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 15240960, while the sum is 62.
The spelling of 130815749789 in words is "one hundred thirty billion, eight hundred fifteen million, seven hundred forty-nine thousand, seven hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •