Base | Representation |
---|---|
bin | 1010000110101100011011… |
… | …0010000000001100011111 |
3 | 1110100010011101122211122220 |
4 | 2201223012302000030133 |
5 | 2424012011312033343 |
6 | 35343530250240423 |
7 | 2224452066302652 |
oct | 241530662001437 |
9 | 43303141584586 |
10 | 11110120424223 |
11 | 35a3859380577 |
12 | 12b5270a26113 |
13 | 6278ab865ca2 |
14 | 2a5a38745899 |
15 | 143eee13d183 |
hex | a1ac6c8031f |
11110120424223 has 16 divisors (see below), whose sum is σ = 15397158112896. Its totient is φ = 7119738514080.
The previous prime is 11110120424203. The next prime is 11110120424261. The reversal of 11110120424223 is 32242402101111.
It is not a de Polignac number, because 11110120424223 - 26 = 11110120424159 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11110120424193 and 11110120424202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11110120424203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 602949673 + ... + 602968098.
It is an arithmetic number, because the mean of its divisors is an integer number (962322382056).
Almost surely, 211110120424223 is an apocalyptic number.
11110120424223 is a deficient number, since it is larger than the sum of its proper divisors (4287037688673).
11110120424223 is a wasteful number, since it uses less digits than its factorization.
11110120424223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1205917894.
The product of its (nonzero) digits is 768, while the sum is 24.
Adding to 11110120424223 its reverse (32242402101111), we get a palindrome (43352522525334).
The spelling of 11110120424223 in words is "eleven trillion, one hundred ten billion, one hundred twenty million, four hundred twenty-four thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.020 sec. • engine limits •