Base | Representation |
---|---|
bin | 101101010010011110110… |
… | …001001101000100011110 |
3 | 102000112011222001000011000 |
4 | 231102132301031010132 |
5 | 401442311311133042 |
6 | 10341422324011130 |
7 | 440564466461040 |
oct | 55223661150436 |
9 | 12015158030130 |
10 | 3112220021022 |
11 | a9a981080502 |
12 | 423204230aa6 |
13 | 197633c4b2c8 |
14 | aa8bcc89a90 |
15 | 55e516b074c |
hex | 2d49ec4d11e |
3112220021022 has 64 divisors (see below), whose sum is σ = 8320053542400. Its totient is φ = 842405417280.
The previous prime is 3112220021017. The next prime is 3112220021077. The reversal of 3112220021022 is 2201200222113.
3112220021022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 3112220020986 and 3112220021004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 216660879 + ... + 216675242.
It is an arithmetic number, because the mean of its divisors is an integer number (130000836600).
Almost surely, 23112220021022 is an apocalyptic number.
3112220021022 is an abundant number, since it is smaller than the sum of its proper divisors (5207833521378).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3112220021022 is a wasteful number, since it uses less digits than its factorization.
3112220021022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 433336158 (or 433336152 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 3112220021022 its reverse (2201200222113), we get a palindrome (5313420243135).
The spelling of 3112220021022 in words is "three trillion, one hundred twelve billion, two hundred twenty million, twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •