Base | Representation |
---|---|
bin | 11001100010001101011010… |
… | …101111001111001101001011 |
3 | 112201121222011201022011221211 |
4 | 121202031122233033031023 |
5 | 104204424030222033003 |
6 | 1034502501423313551 |
7 | 32440361022530662 |
oct | 3142153257171513 |
9 | 481558151264854 |
10 | 112302032221003 |
11 | 3286802a531a69 |
12 | 10718a7744b8b7 |
13 | 4a880616b0661 |
14 | 1da36397b7dd9 |
15 | ceb3784c896d |
hex | 66235abcf34b |
112302032221003 has 4 divisors (see below), whose sum is σ = 112302323921008. Its totient is φ = 112301740521000.
The previous prime is 112302032220943. The next prime is 112302032221009. The reversal of 112302032221003 is 300122230203211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112302032221003 is a prime.
It is a super-2 number, since 2×1123020322210032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112302032221009) 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, 145271751 + ... + 146042752.
It is an arithmetic number, because the mean of its divisors is an integer number (28075580980252).
Almost surely, 2112302032221003 is an apocalyptic number.
112302032221003 is a deficient number, since it is larger than the sum of its proper divisors (291700005).
112302032221003 is an equidigital number, since it uses as much as digits as its factorization.
112302032221003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 291700004.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 112302032221003 its reverse (300122230203211), we get a palindrome (412424262424214).
The spelling of 112302032221003 in words is "one hundred twelve trillion, three hundred two billion, thirty-two million, two hundred twenty-one thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •