Base | Representation |
---|---|
bin | 101011111110100011010… |
… | …100010111001001101001 |
3 | 101200220120111010212212222 |
4 | 223332203110113021221 |
5 | 344003231110024001 |
6 | 10232200130443425 |
7 | 431224335303062 |
oct | 53764324271151 |
9 | 11626514125788 |
10 | 3022102033001 |
11 | a657368a2257 |
12 | 409853a33575 |
13 | 18bca1857b3c |
14 | a63b0437569 |
15 | 53929cc961b |
hex | 2bfa3517269 |
3022102033001 has 2 divisors, whose sum is σ = 3022102033002. Its totient is φ = 3022102033000.
The previous prime is 3022102032979. The next prime is 3022102033037. The reversal of 3022102033001 is 1003302012203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2008810155625 + 1013291877376 = 1417325^2 + 1006624^2 .
It is an emirp because it is prime and its reverse (1003302012203) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3022102033001 - 238 = 2747224126057 is a prime.
It is not a weakly prime, because it can be changed into another prime (3022102033061) 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, 1511051016500 + 1511051016501.
It is an arithmetic number, because the mean of its divisors is an integer number (1511051016501).
Almost surely, 23022102033001 is an apocalyptic number.
It is an amenable number.
3022102033001 is a deficient number, since it is larger than the sum of its proper divisors (1).
3022102033001 is an equidigital number, since it uses as much as digits as its factorization.
3022102033001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 3022102033001 its reverse (1003302012203), we get a palindrome (4025404045204).
The spelling of 3022102033001 in words is "three trillion, twenty-two billion, one hundred two million, thirty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •