Base | Representation |
---|---|
bin | 10100101101101010… |
… | …11001000011000111 |
3 | 1001201000012121022010 |
4 | 22112311121003013 |
5 | 140233322410343 |
6 | 5035251105303 |
7 | 542401542231 |
oct | 122665310307 |
9 | 31630177263 |
10 | 11120513223 |
11 | 47972701a6 |
12 | 21a42a2233 |
13 | 1082ba1051 |
14 | 776cc1251 |
15 | 451446d33 |
hex | 296d590c7 |
11120513223 has 8 divisors (see below), whose sum is σ = 15305652736. Its totient is φ = 7174524600.
The previous prime is 11120513177. The next prime is 11120513251. The reversal of 11120513223 is 32231502111.
11120513223 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11120513223 - 220 = 11119464647 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11120513223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11120513273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 59787613 + ... + 59787798.
It is an arithmetic number, because the mean of its divisors is an integer number (1913206592).
Almost surely, 211120513223 is an apocalyptic number.
11120513223 is a deficient number, since it is larger than the sum of its proper divisors (4185139513).
11120513223 is a wasteful number, since it uses less digits than its factorization.
11120513223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119575445.
The product of its (nonzero) digits is 360, while the sum is 21.
The spelling of 11120513223 in words is "eleven billion, one hundred twenty million, five hundred thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •