Base | Representation |
---|---|
bin | 1000110001000100001… |
… | …11000111010011101001 |
3 | 1001210111112120111111101 |
4 | 10120202013013103221 |
5 | 14413344310013001 |
6 | 350213434001401 |
7 | 30522340522513 |
oct | 4304207072351 |
9 | 1053445514441 |
10 | 301220001001 |
11 | 106823924097 |
12 | 4a465b76261 |
13 | 22535806aaa |
14 | 1081719abb3 |
15 | 7c7e84aa01 |
hex | 46221c74e9 |
301220001001 has 2 divisors, whose sum is σ = 301220001002. Its totient is φ = 301220001000.
The previous prime is 301220000999. The next prime is 301220001067. The reversal of 301220001001 is 100100022103.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 249155714025 + 52064286976 = 499155^2 + 228176^2 .
It is an emirp because it is prime and its reverse (100100022103) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 301220001001 - 21 = 301220000999 is a prime.
Together with 301220000999, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (301220061001) 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, 150610000500 + 150610000501.
It is an arithmetic number, because the mean of its divisors is an integer number (150610000501).
Almost surely, 2301220001001 is an apocalyptic number.
It is an amenable number.
301220001001 is a deficient number, since it is larger than the sum of its proper divisors (1).
301220001001 is an equidigital number, since it uses as much as digits as its factorization.
301220001001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 301220001001 its reverse (100100022103), we get a palindrome (401320023104).
The spelling of 301220001001 in words is "three hundred one billion, two hundred twenty million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •