Base | Representation |
---|---|
bin | 110100001010100001… |
… | …0011110011001010110 |
3 | 101201011000101022120020 |
4 | 1220111002132121112 |
5 | 3313410130320042 |
6 | 123243502450010 |
7 | 11044004211051 |
oct | 1502502363126 |
9 | 351130338506 |
10 | 112022120022 |
11 | 4356562588a |
12 | 19863b93906 |
13 | a74341a627 |
14 | 55c9999a98 |
15 | 2da98c93ec |
hex | 1a1509e656 |
112022120022 has 8 divisors (see below), whose sum is σ = 224044240056. Its totient is φ = 37340706672.
The previous prime is 112022119987. The next prime is 112022120029. The reversal of 112022120022 is 220021220211.
It is a sphenic number, since it is the product of 3 distinct primes.
112022120022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 112022119983 and 112022120010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112022120029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9335176663 + ... + 9335176674.
It is an arithmetic number, because the mean of its divisors is an integer number (28005530007).
Almost surely, 2112022120022 is an apocalyptic number.
112022120022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112022120022 is a wasteful number, since it uses less digits than its factorization.
112022120022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18670353342.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 112022120022 its reverse (220021220211), we get a palindrome (332043340233).
The spelling of 112022120022 in words is "one hundred twelve billion, twenty-two million, one hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.262 sec. • engine limits •