Base | Representation |
---|---|
bin | 111100101011110110… |
… | …0011111111110111011 |
3 | 110110101020122021101021 |
4 | 1321113230133332323 |
5 | 4113343444131021 |
6 | 135511320203311 |
7 | 12262313201314 |
oct | 1712754377673 |
9 | 413336567337 |
10 | 130320302011 |
11 | 502a545a839 |
12 | 21310009537 |
13 | c39b360353 |
14 | 6443c4560b |
15 | 35cb032c41 |
hex | 1e57b1ffbb |
130320302011 has 2 divisors, whose sum is σ = 130320302012. Its totient is φ = 130320302010.
The previous prime is 130320302003. The next prime is 130320302027. The reversal of 130320302011 is 110203023031.
It is an a-pointer prime, because the next prime (130320302027) can be obtained adding 130320302011 to its sum of digits (16).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 130320302011 - 23 = 130320302003 is a prime.
It is a super-2 number, since 2×1303203020112 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (130320302071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65160151005 + 65160151006.
It is an arithmetic number, because the mean of its divisors is an integer number (65160151006).
Almost surely, 2130320302011 is an apocalyptic number.
130320302011 is a deficient number, since it is larger than the sum of its proper divisors (1).
130320302011 is an equidigital number, since it uses as much as digits as its factorization.
130320302011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 130320302011 its reverse (110203023031), we get a palindrome (240523325042).
The spelling of 130320302011 in words is "one hundred thirty billion, three hundred twenty million, three hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •