Base | Representation |
---|---|
bin | 101011111110101001110… |
… | …111111110101001101101 |
3 | 101200220212011010110200221 |
4 | 223332221313332221231 |
5 | 344003442240030013 |
6 | 10232215100251341 |
7 | 431230142265136 |
oct | 53765167765155 |
9 | 11626764113627 |
10 | 3022212033133 |
11 | a657929a3a57 |
12 | 409884840b51 |
13 | 18bcbb590287 |
14 | a63c0cacc8d |
15 | 539347a708d |
hex | 2bfa9dfea6d |
3022212033133 has 16 divisors (see below), whose sum is σ = 3109293476352. Its totient is φ = 2935780848000.
The previous prime is 3022212033109. The next prime is 3022212033143. The reversal of 3022212033133 is 3313302122203.
It is a cyclic number.
It is not a de Polignac number, because 3022212033133 - 213 = 3022212024941 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3022212033098 and 3022212033107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3022212033143) 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 in 15 ways as a sum of consecutive naturals, for example, 17837728 + ... + 18006358.
It is an arithmetic number, because the mean of its divisors is an integer number (194330842272).
Almost surely, 23022212033133 is an apocalyptic number.
It is an amenable number.
3022212033133 is a deficient number, since it is larger than the sum of its proper divisors (87081443219).
3022212033133 is a wasteful number, since it uses less digits than its factorization.
3022212033133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 170556.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 3022212033133 its reverse (3313302122203), we get a palindrome (6335514155336).
The spelling of 3022212033133 in words is "three trillion, twenty-two billion, two hundred twelve million, thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.164 sec. • engine limits •