Base | Representation |
---|---|
bin | 10000010100111101001… |
… | …000111010111110001100 |
3 | 10222021002221221001110210 |
4 | 100110331020322332030 |
5 | 121340340111310012 |
6 | 2215240103402420 |
7 | 144030336311016 |
oct | 20247510727614 |
9 | 3867087831423 |
10 | 1122012213132 |
11 | 3a292a709578 |
12 | 161553753410 |
13 | 81a61315265 |
14 | 3c43cb071b6 |
15 | 1e2bd1e323c |
hex | 1053d23af8c |
1122012213132 has 12 divisors (see below), whose sum is σ = 2618028497336. Its totient is φ = 374004071040.
The previous prime is 1122012213037. The next prime is 1122012213143. The reversal of 1122012213132 is 2313122102211.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×11220122131322 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1122012213099 and 1122012213108.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 46750508869 + ... + 46750508892.
Almost surely, 21122012213132 is an apocalyptic number.
1122012213132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1122012213132 is an abundant number, since it is smaller than the sum of its proper divisors (1496016284204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1122012213132 is a wasteful number, since it uses less digits than its factorization.
1122012213132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 93501017768 (or 93501017766 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 1122012213132 its reverse (2313122102211), we get a palindrome (3435134315343).
The spelling of 1122012213132 in words is "one trillion, one hundred twenty-two billion, twelve million, two hundred thirteen thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •