Base | Representation |
---|---|
bin | 100010010000011001000100… |
… | …1011010110101100101111011 |
3 | 1110111212220200001101222110001 |
4 | 1010200302021122311211323 |
5 | 303443311410432211102 |
6 | 2544504302240333431 |
7 | 120316440161120335 |
oct | 10440621132654573 |
9 | 1414786601358401 |
10 | 301320031132027 |
11 | 880121201a4686 |
12 | 29965a10914277 |
13 | cc194844871ab |
14 | 5459d7848c455 |
15 | 24c805b0ee487 |
hex | 1120c896b597b |
301320031132027 has 2 divisors, whose sum is σ = 301320031132028. Its totient is φ = 301320031132026.
The previous prime is 301320031131997. The next prime is 301320031132051. The reversal of 301320031132027 is 720231130023103.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-301320031132027 is a prime.
It is a super-2 number, since 2×3013200311320272 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 301320031131986 and 301320031132004.
It is not a weakly prime, because it can be changed into another prime (301320031132327) 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, 150660015566013 + 150660015566014.
It is an arithmetic number, because the mean of its divisors is an integer number (150660015566014).
Almost surely, 2301320031132027 is an apocalyptic number.
301320031132027 is a deficient number, since it is larger than the sum of its proper divisors (1).
301320031132027 is an equidigital number, since it uses as much as digits as its factorization.
301320031132027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 28.
The spelling of 301320031132027 in words is "three hundred one trillion, three hundred twenty billion, thirty-one million, one hundred thirty-two thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •