Base | Representation |
---|---|
bin | 11001011110010011001001… |
… | …001111000010100110100011 |
3 | 112200200021112112002000102102 |
4 | 121132103021033002212203 |
5 | 104141023201044041344 |
6 | 1034135220002041015 |
7 | 32412065456020115 |
oct | 3136231117024643 |
9 | 480607475060372 |
10 | 112033303112099 |
11 | 327740699a5016 |
12 | 1069497a64916b |
13 | 4a6890632c605 |
14 | 1d946257c53b5 |
15 | ce439b2d3e4e |
hex | 65e4c93c29a3 |
112033303112099 has 4 divisors (see below), whose sum is σ = 112033354346760. Its totient is φ = 112033251877440.
The previous prime is 112033303112089. The next prime is 112033303112111. The reversal of 112033303112099 is 990211303330211.
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 112033303112099 - 236 = 111964583635363 is a prime.
It is a super-2 number, since 2×1120333031120992 (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 (112033303112089) 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 3 ways as a sum of consecutive naturals, for example, 22183937 + ... + 26761794.
It is an arithmetic number, because the mean of its divisors is an integer number (28008338586690).
Almost surely, 2112033303112099 is an apocalyptic number.
112033303112099 is a deficient number, since it is larger than the sum of its proper divisors (51234661).
112033303112099 is an equidigital number, since it uses as much as digits as its factorization.
112033303112099 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51234660.
The product of its (nonzero) digits is 26244, while the sum is 38.
The spelling of 112033303112099 in words is "one hundred twelve trillion, thirty-three billion, three hundred three million, one hundred twelve thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •