Base | Representation |
---|---|
bin | 1010000111010010000001… |
… | …0110001011001011100111 |
3 | 1110101002012202122111000111 |
4 | 2201310200112023023213 |
5 | 2424143144012410343 |
6 | 35352315541353451 |
7 | 2225260150012456 |
oct | 241644026131347 |
9 | 43332182574014 |
10 | 11120213013223 |
11 | 35a8068385016 |
12 | 12b7208a08887 |
13 | 6288297a0942 |
14 | 2a6314ccab9d |
15 | 1443e01d9c9d |
hex | a1d2058b2e7 |
11120213013223 has 8 divisors (see below), whose sum is σ = 11715657246720. Its totient is φ = 10525785766200.
The previous prime is 11120213013211. The next prime is 11120213013227. The reversal of 11120213013223 is 32231031202111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11120213013223 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11120213013194 and 11120213013203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11120213013227) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 254224165 + ... + 254267902.
It is an arithmetic number, because the mean of its divisors is an integer number (1464457155840).
Almost surely, 211120213013223 is an apocalyptic number.
11120213013223 is a deficient number, since it is larger than the sum of its proper divisors (595444233497).
11120213013223 is a wasteful number, since it uses less digits than its factorization.
11120213013223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 508493237.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 11120213013223 its reverse (32231031202111), we get a palindrome (43351244215334).
The spelling of 11120213013223 in words is "eleven trillion, one hundred twenty billion, two hundred thirteen million, thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •