Base | Representation |
---|---|
bin | 11001100000111011100111… |
… | …101110100010100100110010 |
3 | 112201022120110202201100101020 |
4 | 121200323213232202210302 |
5 | 104202004142021444214 |
6 | 1034354254321120310 |
7 | 32431131365242026 |
oct | 3140734756424462 |
9 | 481276422640336 |
10 | 112214203312434 |
11 | 3283385a396013 |
12 | 10703a45789096 |
13 | 4a7c9a560a782 |
14 | 1d9d2a6d90386 |
15 | ce8e37a584a9 |
hex | 660ee7ba2932 |
112214203312434 has 8 divisors (see below), whose sum is σ = 224428406624880. Its totient is φ = 37404734437476.
The previous prime is 112214203312429. The next prime is 112214203312499. The reversal of 112214203312434 is 434213302412211.
It is a sphenic number, since it is the product of 3 distinct primes.
112214203312434 is an admirable number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 112214203312395 and 112214203312404.
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, 9351183609364 + ... + 9351183609375.
It is an arithmetic number, because the mean of its divisors is an integer number (28053550828110).
Almost surely, 2112214203312434 is an apocalyptic number.
112214203312434 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112214203312434 is a wasteful number, since it uses less digits than its factorization.
112214203312434 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18702367218744.
The product of its (nonzero) digits is 27648, while the sum is 33.
Adding to 112214203312434 its reverse (434213302412211), we get a palindrome (546427505724645).
The spelling of 112214203312434 in words is "one hundred twelve trillion, two hundred fourteen billion, two hundred three million, three hundred twelve thousand, four hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •