Base | Representation |
---|---|
bin | 1010000110110011100010… |
… | …0111010010111110111111 |
3 | 1110100022002111021112021002 |
4 | 2201230320213102332333 |
5 | 2424024414214021343 |
6 | 35344443552000515 |
7 | 2224550316302222 |
oct | 241547047227677 |
9 | 43308074245232 |
10 | 11112030220223 |
11 | 35a4649407579 |
12 | 12b570453013b |
13 | 627b244195aa |
14 | 2a5b7a23d5b9 |
15 | 1440b1b338b8 |
hex | a1b389d2fbf |
11112030220223 has 4 divisors (see below), whose sum is σ = 11136778617600. Its totient is φ = 11087281822848.
The previous prime is 11112030220189. The next prime is 11112030220229. The reversal of 11112030220223 is 32202203021111.
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 11112030220223 - 224 = 11112013443007 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11112030220195 and 11112030220204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11112030220229) 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, 12374198015 + ... + 12374198912.
It is an arithmetic number, because the mean of its divisors is an integer number (2784194654400).
Almost surely, 211112030220223 is an apocalyptic number.
11112030220223 is a deficient number, since it is larger than the sum of its proper divisors (24748397377).
11112030220223 is an equidigital number, since it uses as much as digits as its factorization.
11112030220223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24748397376.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 11112030220223 its reverse (32202203021111), we get a palindrome (43314233241334).
The spelling of 11112030220223 in words is "eleven trillion, one hundred twelve billion, thirty million, two hundred twenty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •