Base | Representation |
---|---|
bin | 11110101111000100010… |
… | …011010010001110000000 |
3 | 21110220202102210110120020 |
4 | 132233010103102032000 |
5 | 234101111304111112 |
6 | 4254143503413440 |
7 | 305411234413326 |
oct | 36570423221600 |
9 | 7426672713506 |
10 | 2112122332032 |
11 | 744822aa2409 |
12 | 2a14155b4280 |
13 | 12423166ab3b |
14 | 74327893d16 |
15 | 39e1b59e48c |
hex | 1ebc44d2380 |
2112122332032 has 32 divisors (see below), whose sum is σ = 5610324945480. Its totient is φ = 704040777216.
The previous prime is 2112122332027. The next prime is 2112122332051. The reversal of 2112122332032 is 2302332212112.
It is a tau number, because it is divible by the number of its divisors (32).
It is a super-2 number, since 2×21121223320322 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 2112122331993 and 2112122332011.
It is a congruent number.
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, 2750158903 + ... + 2750159670.
Almost surely, 22112122332032 is an apocalyptic number.
It is an amenable number.
2112122332032 is an abundant number, since it is smaller than the sum of its proper divisors (3498202613448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2112122332032 is an equidigital number, since it uses as much as digits as its factorization.
2112122332032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5500318590 (or 5500318578 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 2112122332032 its reverse (2302332212112), we get a palindrome (4414454544144).
The spelling of 2112122332032 in words is "two trillion, one hundred twelve billion, one hundred twenty-two million, three hundred thirty-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •