Base | Representation |
---|---|
bin | 101110110111111111110… |
… | …011100100010110011110 |
3 | 102101221112111220002021020 |
4 | 232313333303210112132 |
5 | 410234030341304042 |
6 | 10503450431145010 |
7 | 451503614020212 |
oct | 56677763442636 |
9 | 12357474802236 |
10 | 3221222213022 |
11 | 1032126a64700 |
12 | 440364975166 |
13 | 1a49b57c7978 |
14 | b1c9d732942 |
15 | 58bd0dab3ec |
hex | 2edffce459e |
3221222213022 has 24 divisors (see below), whose sum is σ = 7081364536008. Its totient is φ = 976127943120.
The previous prime is 3221222212997. The next prime is 3221222213029. The reversal of 3221222213022 is 2203122221223.
It is a super-2 number, since 2×32212222130222 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3221222212983 and 3221222213001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3221222213029) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2218471873 + ... + 2218473324.
It is an arithmetic number, because the mean of its divisors is an integer number (295056855667).
Almost surely, 23221222213022 is an apocalyptic number.
3221222213022 is an abundant number, since it is smaller than the sum of its proper divisors (3860142322986).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3221222213022 is a wasteful number, since it uses less digits than its factorization.
3221222213022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4436945224 (or 4436945213 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 3221222213022 its reverse (2203122221223), we get a palindrome (5424344434245).
The spelling of 3221222213022 in words is "three trillion, two hundred twenty-one billion, two hundred twenty-two million, two hundred thirteen thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •