Base | Representation |
---|---|
bin | 110100001100111001… |
… | …1010001110010111010 |
3 | 101201100120201202220222 |
4 | 1220121303101302322 |
5 | 3314041104203310 |
6 | 123255435220042 |
7 | 11045664316304 |
oct | 1503163216272 |
9 | 351316652828 |
10 | 112102022330 |
11 | 435a673a651 |
12 | 198868a7622 |
13 | a756b453bc |
14 | 55d6438974 |
15 | 2db190e055 |
hex | 1a19cd1cba |
112102022330 has 8 divisors (see below), whose sum is σ = 201783640212. Its totient is φ = 44840808928.
The previous prime is 112102022323. The next prime is 112102022377. The reversal of 112102022330 is 33220201211.
It can be written as a sum of positive squares in 2 ways, for example, as 112095727249 + 6295081 = 334807^2 + 2509^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×1121020223303 (a number of 34 digits) contains 333 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 112102022299 and 112102022308.
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, 5605101107 + ... + 5605101126.
Almost surely, 2112102022330 is an apocalyptic number.
112102022330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
112102022330 is a deficient number, since it is larger than the sum of its proper divisors (89681617882).
112102022330 is a wasteful number, since it uses less digits than its factorization.
112102022330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11210202240.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 112102022330 its reverse (33220201211), we get a palindrome (145322223541).
The spelling of 112102022330 in words is "one hundred twelve billion, one hundred two million, twenty-two thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •