Base | Representation |
---|---|
bin | 111100101001001010… |
… | …0011010110100000101 |
3 | 110110010221220201000022 |
4 | 1321102110122310011 |
5 | 4113202401301201 |
6 | 135454335024525 |
7 | 12260136420314 |
oct | 1712224326405 |
9 | 413127821008 |
10 | 130230103301 |
11 | 50259553151 |
12 | 212a596b145 |
13 | c38576bb2c |
14 | 6435c8627b |
15 | 35c316741b |
hex | 1e5251ad05 |
130230103301 has 2 divisors, whose sum is σ = 130230103302. Its totient is φ = 130230103300.
The previous prime is 130230103207. The next prime is 130230103309. The reversal of 130230103301 is 103301032031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 103250398276 + 26979705025 = 321326^2 + 164255^2 .
It is a cyclic number.
It is not a de Polignac number, because 130230103301 - 222 = 130225908997 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 130230103301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130230103309) 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, 65115051650 + 65115051651.
It is an arithmetic number, because the mean of its divisors is an integer number (65115051651).
Almost surely, 2130230103301 is an apocalyptic number.
It is an amenable number.
130230103301 is a deficient number, since it is larger than the sum of its proper divisors (1).
130230103301 is an equidigital number, since it uses as much as digits as its factorization.
130230103301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 130230103301 its reverse (103301032031), we get a palindrome (233531135332).
The spelling of 130230103301 in words is "one hundred thirty billion, two hundred thirty million, one hundred three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •