Base | Representation |
---|---|
bin | 11101101111110101000… |
… | …01000010000001111110 |
3 | 10121201020121200120201000 |
4 | 32313322201002001332 |
5 | 113221240203242342 |
6 | 2101315001031130 |
7 | 133562562312111 |
oct | 16677241020176 |
9 | 3551217616630 |
10 | 1022110212222 |
11 | 364524628660 |
12 | 1461127854a6 |
13 | 754ccbc8658 |
14 | 37682ab6578 |
15 | 1b8c28b544c |
hex | edfa84207e |
1022110212222 has 64 divisors (see below), whose sum is σ = 2512742238720. Its totient is φ = 305367955200.
The previous prime is 1022110212217. The next prime is 1022110212421. The reversal of 1022110212222 is 2222120112201.
It is a happy number.
1022110212222 is a `hidden beast` number, since 1 + 0 + 221 + 10 + 212 + 222 = 666.
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 = 1022110212195 and 1022110212204.
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, 12075603 + ... + 12159950.
It is an arithmetic number, because the mean of its divisors is an integer number (39261597480).
Almost surely, 21022110212222 is an apocalyptic number.
1022110212222 is an abundant number, since it is smaller than the sum of its proper divisors (1490632026498).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1022110212222 is a wasteful number, since it uses less digits than its factorization.
1022110212222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24235646 (or 24235640 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 1022110212222 its reverse (2222120112201), we get a palindrome (3244230324423).
The spelling of 1022110212222 in words is "one trillion, twenty-two billion, one hundred ten million, two hundred twelve thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •