Base | Representation |
---|---|
bin | 11001100010100001000011… |
… | …110110001011101010011011 |
3 | 112201200222121120022212110011 |
4 | 121202201003312023222123 |
5 | 104210300223442031021 |
6 | 1034520310320102351 |
7 | 32442035461313305 |
oct | 3142410366135233 |
9 | 481628546285404 |
10 | 112323123002011 |
11 | 32875a72749999 |
12 | 10720b827649b7 |
13 | 4a8a04305ba2c |
14 | 1da467a8bc975 |
15 | cebbaeda8de1 |
hex | 662843d8ba9b |
112323123002011 has 8 divisors (see below), whose sum is σ = 112934298067200. Its totient is φ = 111712188519360.
The previous prime is 112323123002009. The next prime is 112323123002017. The reversal of 112323123002011 is 110200321323211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 112323123002011 - 21 = 112323123002009 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112323123002017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 59209296 + ... + 61076893.
It is an arithmetic number, because the mean of its divisors is an integer number (14116787258400).
Almost surely, 2112323123002011 is an apocalyptic number.
112323123002011 is a deficient number, since it is larger than the sum of its proper divisors (611175065189).
112323123002011 is a wasteful number, since it uses less digits than its factorization.
112323123002011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120291269.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 112323123002011 its reverse (110200321323211), we get a palindrome (222523444325222).
The spelling of 112323123002011 in words is "one hundred twelve trillion, three hundred twenty-three billion, one hundred twenty-three million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •