Base | Representation |
---|---|
bin | 111100101011010000… |
… | …0010100000100111101 |
3 | 110110022212001121100022 |
4 | 1321112200110010331 |
5 | 4113323341032201 |
6 | 135505324141525 |
7 | 12261651350621 |
oct | 1712640240475 |
9 | 413285047308 |
10 | 130300330301 |
11 | 50295159799 |
12 | 213053978a5 |
13 | c397189a7b |
14 | 6441327181 |
15 | 35c93da41b |
hex | 1e5681413d |
130300330301 has 2 divisors, whose sum is σ = 130300330302. Its totient is φ = 130300330300.
The previous prime is 130300330247. The next prime is 130300330309. The reversal of 130300330301 is 103033003031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 109144336900 + 21155993401 = 330370^2 + 145451^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130300330301 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 130300330301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130300330309) 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, 65150165150 + 65150165151.
It is an arithmetic number, because the mean of its divisors is an integer number (65150165151).
Almost surely, 2130300330301 is an apocalyptic number.
It is an amenable number.
130300330301 is a deficient number, since it is larger than the sum of its proper divisors (1).
130300330301 is an equidigital number, since it uses as much as digits as its factorization.
130300330301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 243, while the sum is 17.
Adding to 130300330301 its reverse (103033003031), we get a palindrome (233333333332).
The spelling of 130300330301 in words is "one hundred thirty billion, three hundred million, three hundred thirty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •