Base | Representation |
---|---|
bin | 1001100110101011011110… |
… | …10101000111011111100010 |
3 | 2202210001222120210100221000 |
4 | 10303111233111013133202 |
5 | 10232013203313013442 |
6 | 112530255051212430 |
7 | 4306612534642626 |
oct | 463255725073742 |
9 | 82701876710830 |
10 | 21120222001122 |
11 | 6803043797852 |
12 | 24512a7747116 |
13 | ba282275513a |
14 | 53031d2b9186 |
15 | 2695bad05d4c |
hex | 13356f5477e2 |
21120222001122 has 128 divisors (see below), whose sum is σ = 52828074028800. Its totient is φ = 6215066496000.
The previous prime is 21120222001097. The next prime is 21120222001181. The reversal of 21120222001122 is 22110022202112.
It is a happy number.
21120222001122 is a `hidden beast` number, since 211 + 202 + 220 + 0 + 11 + 22 = 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 = 21120222001095 and 21120222001104.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4232829 + ... + 7756112.
It is an arithmetic number, because the mean of its divisors is an integer number (412719328350).
Almost surely, 221120222001122 is an apocalyptic number.
21120222001122 is an abundant number, since it is smaller than the sum of its proper divisors (31707852027678).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21120222001122 is a wasteful number, since it uses less digits than its factorization.
21120222001122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11989089 (or 11989083 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 21120222001122 its reverse (22110022202112), we get a palindrome (43230244203234).
The spelling of 21120222001122 in words is "twenty-one trillion, one hundred twenty billion, two hundred twenty-two million, one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •