Base | Representation |
---|---|
bin | 11001011111100110110010… |
… | …111000000100000000011001 |
3 | 112200222212101011201200002111 |
4 | 121133212302320010000121 |
5 | 104144011123302144001 |
6 | 1034244352403032321 |
7 | 32421425331365335 |
oct | 3137466270040031 |
9 | 480885334650074 |
10 | 112123122303001 |
11 | 327a91705505a7 |
12 | 106aa26696b6a1 |
13 | 4a7421b856654 |
14 | 1d98b066987c5 |
15 | ce68a6847851 |
hex | 65f9b2e04019 |
112123122303001 has 4 divisors (see below), whose sum is σ = 112123156120192. Its totient is φ = 112123088485812.
The previous prime is 112123122302987. The next prime is 112123122303013. The reversal of 112123122303001 is 100303221321211.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 112123122303001 - 29 = 112123122302489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112123122303601) 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, 11319405 + ... + 18771658.
It is an arithmetic number, because the mean of its divisors is an integer number (28030789030048).
Almost surely, 2112123122303001 is an apocalyptic number.
It is an amenable number.
112123122303001 is a deficient number, since it is larger than the sum of its proper divisors (33817191).
112123122303001 is an equidigital number, since it uses as much as digits as its factorization.
112123122303001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33817190.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 112123122303001 its reverse (100303221321211), we get a palindrome (212426343624212).
The spelling of 112123122303001 in words is "one hundred twelve trillion, one hundred twenty-three billion, one hundred twenty-two million, three hundred three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •