Base | Representation |
---|---|
bin | 11101101000100011011001… |
… | …100010001010100010111101 |
3 | 122002110102212100110211020021 |
4 | 131220203121202022202331 |
5 | 114040312110113214124 |
6 | 1141104501040452141 |
7 | 36311020204024612 |
oct | 3550433142124275 |
9 | 562412770424207 |
10 | 130330137241789 |
11 | 38588778856321 |
12 | 1274aa2b31a051 |
13 | 579510502b934 |
14 | 2428025a72509 |
15 | 10102bc9407e4 |
hex | 7688d988a8bd |
130330137241789 has 2 divisors, whose sum is σ = 130330137241790. Its totient is φ = 130330137241788.
The previous prime is 130330137241673. The next prime is 130330137241817. The reversal of 130330137241789 is 987142731033031.
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., 78192105316900 + 52138031924889 = 8842630^2 + 7220667^2 .
It is a cyclic number.
It is not a de Polignac number, because 130330137241789 - 29 = 130330137241277 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130330137247789) 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, 65165068620894 + 65165068620895.
It is an arithmetic number, because the mean of its divisors is an integer number (65165068620895).
Almost surely, 2130330137241789 is an apocalyptic number.
It is an amenable number.
130330137241789 is a deficient number, since it is larger than the sum of its proper divisors (1).
130330137241789 is an equidigital number, since it uses as much as digits as its factorization.
130330137241789 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2286144, while the sum is 52.
The spelling of 130330137241789 in words is "one hundred thirty trillion, three hundred thirty billion, one hundred thirty-seven million, two hundred forty-one thousand, seven hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •