Base | Representation |
---|---|
bin | 101011111110011101111… |
… | …001011111011111100001 |
3 | 101200220100011001011122121 |
4 | 223332131321133133201 |
5 | 344003034320300301 |
6 | 10232143121504241 |
7 | 431222152355446 |
oct | 53763571373741 |
9 | 11626304034577 |
10 | 3022011103201 |
11 | a6569a536362 |
12 | 4098294a2081 |
13 | 18bc88a6b91c |
14 | a63a23279cd |
15 | 53921d173a1 |
hex | 2bf9de5f7e1 |
3022011103201 has 2 divisors, whose sum is σ = 3022011103202. Its totient is φ = 3022011103200.
The previous prime is 3022011103129. The next prime is 3022011103211. The reversal of 3022011103201 is 1023011102203.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2581083230625 + 440927872576 = 1606575^2 + 664024^2 .
It is a cyclic number.
It is not a de Polignac number, because 3022011103201 - 213 = 3022011095009 is a prime.
It is a super-2 number, since 2×30220111032012 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3022011103211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1511005551600 + 1511005551601.
It is an arithmetic number, because the mean of its divisors is an integer number (1511005551601).
Almost surely, 23022011103201 is an apocalyptic number.
It is an amenable number.
3022011103201 is a deficient number, since it is larger than the sum of its proper divisors (1).
3022011103201 is an equidigital number, since it uses as much as digits as its factorization.
3022011103201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 3022011103201 its reverse (1023011102203), we get a palindrome (4045022205404).
The spelling of 3022011103201 in words is "three trillion, twenty-two billion, eleven million, one hundred three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •