Base | Representation |
---|---|
bin | 101011101100000001101… |
… | …110001100010100011001 |
3 | 101122000020020201001012102 |
4 | 223230001232030110121 |
5 | 343142012010314301 |
6 | 10215110253253145 |
7 | 426621405445442 |
oct | 53540156142431 |
9 | 11560206631172 |
10 | 3002211026201 |
11 | a58259947462 |
12 | 405a224941b5 |
13 | 18a15192222a |
14 | a54448042c9 |
15 | 531638dcb6b |
hex | 2bb01b8c519 |
3002211026201 has 2 divisors, whose sum is σ = 3002211026202. Its totient is φ = 3002211026200.
The previous prime is 3002211026161. The next prime is 3002211026203. The reversal of 3002211026201 is 1026201122003.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1928709888400 + 1073501137801 = 1388780^2 + 1036099^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3002211026201 is a prime.
Together with 3002211026203, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (3002211026203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1501105513100 + 1501105513101.
It is an arithmetic number, because the mean of its divisors is an integer number (1501105513101).
Almost surely, 23002211026201 is an apocalyptic number.
It is an amenable number.
3002211026201 is a deficient number, since it is larger than the sum of its proper divisors (1).
3002211026201 is an equidigital number, since it uses as much as digits as its factorization.
3002211026201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 3002211026201 its reverse (1026201122003), we get a palindrome (4028412148204).
The spelling of 3002211026201 in words is "three trillion, two billion, two hundred eleven million, twenty-six thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •