Base | Representation |
---|---|
bin | 110100010011001010… |
… | …1111011101000110010 |
3 | 101201220020122202101020 |
4 | 1220212111323220302 |
5 | 3320003440330302 |
6 | 123332353120310 |
7 | 11054130634134 |
oct | 1504625735062 |
9 | 351806582336 |
10 | 112312433202 |
11 | 436a4493432 |
12 | 19925259096 |
13 | a78b606288 |
14 | 561636b054 |
15 | 2dc5122ebc |
hex | 1a2657ba32 |
112312433202 has 16 divisors (see below), whose sum is σ = 224974212960. Its totient is φ = 37379253312.
The previous prime is 112312433201. The next prime is 112312433203. The reversal of 112312433202 is 202334213211.
It is an interprime number because it is at equal distance from previous prime (112312433201) and next prime (112312433203).
It is a super-2 number, since 2×1123124332022 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (112312433201) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 14551927 + ... + 14559642.
It is an arithmetic number, because the mean of its divisors is an integer number (14060888310).
Almost surely, 2112312433202 is an apocalyptic number.
112312433202 is an abundant number, since it is smaller than the sum of its proper divisors (112661779758).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112312433202 is a wasteful number, since it uses less digits than its factorization.
112312433202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29112217.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 112312433202 its reverse (202334213211), we get a palindrome (314646646413).
The spelling of 112312433202 in words is "one hundred twelve billion, three hundred twelve million, four hundred thirty-three thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •