Base | Representation |
---|---|
bin | 110100010010110111… |
… | …0100101110001010110 |
3 | 101201212112020210100121 |
4 | 1220211232211301112 |
5 | 3314443320320042 |
6 | 123331344102154 |
7 | 11053644161431 |
oct | 1504556456126 |
9 | 351775223317 |
10 | 112302120022 |
11 | 43699689a44 |
12 | 1992190495a |
13 | a789434cc1 |
14 | 5614c44818 |
15 | 2dc4287367 |
hex | 1a25ba5c56 |
112302120022 has 8 divisors (see below), whose sum is σ = 168454985400. Its totient is φ = 56150458224.
The previous prime is 112302120001. The next prime is 112302120067. The reversal of 112302120022 is 220021203211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1123021200222 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112302119978 and 112302120005.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12247 + ... + 474082.
It is an arithmetic number, because the mean of its divisors is an integer number (21056873175).
Almost surely, 2112302120022 is an apocalyptic number.
112302120022 is a deficient number, since it is larger than the sum of its proper divisors (56152865378).
112302120022 is a wasteful number, since it uses less digits than its factorization.
112302120022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 601790.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 112302120022 its reverse (220021203211), we get a palindrome (332323323233).
It can be divided in two parts, 112302 and 120022, that added together give a square (232324 = 4822).
The spelling of 112302120022 in words is "one hundred twelve billion, three hundred two million, one hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •