Base | Representation |
---|---|
bin | 1011000110110001111011… |
… | …1111100011111011000110 |
3 | 1121020101000101112221022200 |
4 | 2301230132333203323012 |
5 | 3100031324133014342 |
6 | 41545412444535330 |
7 | 2400136511300361 |
oct | 261543677437306 |
9 | 47211011487280 |
10 | 12211112001222 |
11 | 3988781421a92 |
12 | 1452718851546 |
13 | 6a766cbbc5c4 |
14 | 3030417a70d8 |
15 | 16298bba994c |
hex | b1b1efe3ec6 |
12211112001222 has 48 divisors (see below), whose sum is σ = 26720034196752. Its totient is φ = 4029968865600.
The previous prime is 12211112001211. The next prime is 12211112001259. The reversal of 12211112001222 is 22210021111221.
It is a super-2 number, since 2×122111120012222 (a number of 27 digits) contains 22 as substring.
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 = 12211112001195 and 12211112001204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 117603613 + ... + 117707399.
It is an arithmetic number, because the mean of its divisors is an integer number (556667379099).
Almost surely, 212211112001222 is an apocalyptic number.
12211112001222 is an abundant number, since it is smaller than the sum of its proper divisors (14508922195530).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12211112001222 is a wasteful number, since it uses less digits than its factorization.
12211112001222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168613 (or 168610 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 12211112001222 its reverse (22210021111221), we get a palindrome (34421133112443).
The spelling of 12211112001222 in words is "twelve trillion, two hundred eleven billion, one hundred twelve million, one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •