Base | Representation |
---|---|
bin | 110100010000001101… |
… | …0101000100010110111 |
3 | 101201122022120010222210 |
4 | 1220200122220202313 |
5 | 3314303012034143 |
6 | 123314442024503 |
7 | 11051512532364 |
oct | 1504032504267 |
9 | 351568503883 |
10 | 112213002423 |
11 | 43653350635 |
12 | 198b7aa8133 |
13 | a773b318b2 |
14 | 560708746b |
15 | 2dbb532033 |
hex | 1a206a88b7 |
112213002423 has 8 divisors (see below), whose sum is σ = 149625585136. Its totient is φ = 74804544000.
The previous prime is 112213002397. The next prime is 112213002449. The reversal of 112213002423 is 324200312211.
It is an interprime number because it is at equal distance from previous prime (112213002397) and next prime (112213002449).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112213002423 - 218 = 112212740279 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 112213002423.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112213002493) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 967018 + ... + 1076823.
It is an arithmetic number, because the mean of its divisors is an integer number (18703198142).
Almost surely, 2112213002423 is an apocalyptic number.
112213002423 is a deficient number, since it is larger than the sum of its proper divisors (37412582713).
112213002423 is a wasteful number, since it uses less digits than its factorization.
112213002423 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2062145.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 112213002423 its reverse (324200312211), we get a palindrome (436413314634).
The spelling of 112213002423 in words is "one hundred twelve billion, two hundred thirteen million, two thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •