Base | Representation |
---|---|
bin | 110100001111111010… |
… | …0100101110111110010 |
3 | 101201121121210111101212 |
4 | 1220133310211313302 |
5 | 3314242433430002 |
6 | 123313444200122 |
7 | 11051332006310 |
oct | 1503764456762 |
9 | 351547714355 |
10 | 112203030002 |
11 | 4364875a168 |
12 | 198b4699042 |
13 | a771a4c75b |
14 | 5605a0d0b0 |
15 | 2dba712352 |
hex | 1a1fd25df2 |
112203030002 has 8 divisors (see below), whose sum is σ = 192348051456. Its totient is φ = 48087012852.
The previous prime is 112203029957. The next prime is 112203030047. The reversal of 112203030002 is 200030302211.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (112203029957) and next prime (112203030047).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×1122030300023 (a number of 34 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14), and also a Moran number because the ratio is a prime number: 8014502143 = 112203030002 / (1 + 1 + 2 + 2 + 0 + 3 + 0 + 3 + 0 + 0 + 0 + 2).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4007251058 + ... + 4007251085.
It is an arithmetic number, because the mean of its divisors is an integer number (24043506432).
Almost surely, 2112203030002 is an apocalyptic number.
112203030002 is a deficient number, since it is larger than the sum of its proper divisors (80145021454).
112203030002 is an equidigital number, since it uses as much as digits as its factorization.
112203030002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8014502152.
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 112203030002 its reverse (200030302211), we get a palindrome (312233332213).
The spelling of 112203030002 in words is "one hundred twelve billion, two hundred three million, thirty thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •