Base | Representation |
---|---|
bin | 110100001011011010… |
… | …1001111011111010010 |
3 | 101201020002222211010000 |
4 | 1220112311033133102 |
5 | 3313440331034042 |
6 | 123250455350430 |
7 | 11044521013635 |
oct | 1502665173722 |
9 | 351202884100 |
10 | 112052205522 |
11 | 43580604534 |
12 | 19872082416 |
13 | a7497224ba |
14 | 55cd98bc1c |
15 | 2dac36d74c |
hex | 1a16d4f7d2 |
112052205522 has 80 divisors (see below), whose sum is σ = 255460024512. Its totient is φ = 36700426080.
The previous prime is 112052205497. The next prime is 112052205523. The reversal of 112052205522 is 225502250211.
It is a happy number.
112052205522 is a `hidden beast` number, since 112 + 0 + 5 + 2 + 20 + 5 + 522 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (112052205523) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 10499233 + ... + 10509899.
Almost surely, 2112052205522 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 112052205522, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (127730012256).
112052205522 is an abundant number, since it is smaller than the sum of its proper divisors (143407818990).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112052205522 is a wasteful number, since it uses less digits than its factorization.
112052205522 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11805 (or 11796 counting only the distinct ones).
The product of its (nonzero) digits is 4000, while the sum is 27.
Adding to 112052205522 its reverse (225502250211), we get a palindrome (337554455733).
The spelling of 112052205522 in words is "one hundred twelve billion, fifty-two million, two hundred five thousand, five hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •