Base | Representation |
---|---|
bin | 110100001001111110… |
… | …1010111101001010001 |
3 | 101201002202021221122111 |
4 | 1220103331113221101 |
5 | 3313341011120213 |
6 | 123242014305321 |
7 | 11043364220656 |
oct | 1502375275121 |
9 | 351082257574 |
10 | 112004004433 |
11 | 43556382322 |
12 | 19859ab8241 |
13 | a73c746b49 |
14 | 55c7401c2d |
15 | 2da7eeba3d |
hex | 1a13f57a51 |
112004004433 has 4 divisors (see below), whose sum is σ = 118592475300. Its totient is φ = 105415533568.
The previous prime is 112004004389. The next prime is 112004004451. The reversal of 112004004433 is 334400400211.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 334400400211 = 89231 ⋅3747581.
It can be written as a sum of positive squares in 2 ways, for example, as 72477793089 + 39526211344 = 269217^2 + 198812^2 .
It is a cyclic number.
It is not a de Polignac number, because 112004004433 - 217 = 112003873361 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112004005433) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3294235408 + ... + 3294235441.
It is an arithmetic number, because the mean of its divisors is an integer number (29648118825).
Almost surely, 2112004004433 is an apocalyptic number.
It is an amenable number.
112004004433 is a deficient number, since it is larger than the sum of its proper divisors (6588470867).
112004004433 is an equidigital number, since it uses as much as digits as its factorization.
112004004433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6588470866.
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 112004004433 its reverse (334400400211), we get a palindrome (446404404644).
The spelling of 112004004433 in words is "one hundred twelve billion, four million, four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •