Base | Representation |
---|---|
bin | 1010000110111000101101… |
… | …1101101100111111010110 |
3 | 1110100102200100210112120121 |
4 | 2201232023131230333112 |
5 | 2424040241033323410 |
6 | 35345233524222154 |
7 | 2224626625121665 |
oct | 241561335547726 |
9 | 43312610715517 |
10 | 11113420214230 |
11 | 35a51a1a91654 |
12 | 12b5a31b3a95a |
13 | 627cb63a3859 |
14 | 2a5c6caa8ddc |
15 | 144143b9d9da |
hex | a1b8b76cfd6 |
11113420214230 has 16 divisors (see below), whose sum is σ = 20004485415264. Its totient is φ = 4445294968000.
The previous prime is 11113420214173. The next prime is 11113420214231. The reversal of 11113420214230 is 3241202431111.
It is a super-5 number, since 5×111134202142305 (a number of 66 digits) contains 55555 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11113420214195 and 11113420214204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11113420214231) 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, 8499202 + ... + 9719221.
It is an arithmetic number, because the mean of its divisors is an integer number (1250280338454).
Almost surely, 211113420214230 is an apocalyptic number.
11113420214230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11113420214230 is a deficient number, since it is larger than the sum of its proper divisors (8891065201034).
11113420214230 is a wasteful number, since it uses less digits than its factorization.
11113420214230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18279431.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 11113420214230 its reverse (3241202431111), we get a palindrome (14354622645341).
The spelling of 11113420214230 in words is "eleven trillion, one hundred thirteen billion, four hundred twenty million, two hundred fourteen thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •