Base | Representation |
---|---|
bin | 110100010101111010… |
… | …0000010110100011111 |
3 | 101202010122100122121212 |
4 | 1220223310002310133 |
5 | 3320200434304043 |
6 | 123345432215035 |
7 | 11056324021604 |
oct | 1505364026437 |
9 | 352118318555 |
10 | 112404213023 |
11 | 4374127aa23 |
12 | 1994bb3a47b |
13 | a7a462c36b |
14 | 562461c6ab |
15 | 2dcd202018 |
hex | 1a2bd02d1f |
112404213023 has 4 divisors (see below), whose sum is σ = 112700794440. Its totient is φ = 112107631608.
The previous prime is 112404212927. The next prime is 112404213059. The reversal of 112404213023 is 320312404211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 112404213023 - 212 = 112404208927 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 112404213023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112404213073) 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 3 ways as a sum of consecutive naturals, for example, 148290140 + ... + 148290897.
It is an arithmetic number, because the mean of its divisors is an integer number (28175198610).
Almost surely, 2112404213023 is an apocalyptic number.
112404213023 is a deficient number, since it is larger than the sum of its proper divisors (296581417).
112404213023 is an equidigital number, since it uses as much as digits as its factorization.
112404213023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 296581416.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 112404213023 its reverse (320312404211), we get a palindrome (432716617234).
The spelling of 112404213023 in words is "one hundred twelve billion, four hundred four million, two hundred thirteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •