Base | Representation |
---|---|
bin | 11001100011101001110111… |
… | …101011110111010111101011 |
3 | 112201222110102000010202102012 |
4 | 121203221313223313113223 |
5 | 104213040331320432021 |
6 | 1035020240110030135 |
7 | 32450504023013555 |
oct | 3143516753672753 |
9 | 481873360122365 |
10 | 112401302124011 |
11 | 328a614083141a |
12 | 107341607a834b |
13 | 4a94521b73834 |
14 | 1da83758a84d5 |
15 | cedc3859835b |
hex | 663a77af75eb |
112401302124011 has 4 divisors (see below), whose sum is σ = 113824103416800. Its totient is φ = 110978500831224.
The previous prime is 112401302123993. The next prime is 112401302124047. The reversal of 112401302124011 is 110421203104211.
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 112401302124011 - 26 = 112401302123947 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112401302124071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 711400646276 + ... + 711400646433.
It is an arithmetic number, because the mean of its divisors is an integer number (28456025854200).
Almost surely, 2112401302124011 is an apocalyptic number.
112401302124011 is a deficient number, since it is larger than the sum of its proper divisors (1422801292789).
112401302124011 is an equidigital number, since it uses as much as digits as its factorization.
112401302124011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1422801292788.
The product of its (nonzero) digits is 384, while the sum is 23.
Adding to 112401302124011 its reverse (110421203104211), we get a palindrome (222822505228222).
The spelling of 112401302124011 in words is "one hundred twelve trillion, four hundred one billion, three hundred two million, one hundred twenty-four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •