Base | Representation |
---|---|
bin | 10100111010000010… |
… | …10111001100010101 |
3 | 1001222020112021002020 |
4 | 22131001113030111 |
5 | 140441411032040 |
6 | 5053440003353 |
7 | 545102046255 |
oct | 123501271425 |
9 | 31866467066 |
10 | 11224314645 |
11 | 483a9187a5 |
12 | 2213000559 |
13 | 109b545bcb |
14 | 7869c1965 |
15 | 45a5eccd0 |
hex | 29d057315 |
11224314645 has 32 divisors (see below), whose sum is σ = 18035042688. Its totient is φ = 5960982528.
The previous prime is 11224314641. The next prime is 11224314649. The reversal of 11224314645 is 54641342211.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (11224314641) and next prime (11224314649).
It is not a de Polignac number, because 11224314645 - 22 = 11224314641 is a prime.
It is a super-2 number, since 2×112243146452 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11224314641) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4040497 + ... + 4043273.
It is an arithmetic number, because the mean of its divisors is an integer number (563595084).
Almost surely, 211224314645 is an apocalyptic number.
11224314645 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11224314645 is a deficient number, since it is larger than the sum of its proper divisors (6810728043).
11224314645 is a wasteful number, since it uses less digits than its factorization.
11224314645 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3829.
The product of its digits is 23040, while the sum is 33.
Adding to 11224314645 its reverse (54641342211), we get a palindrome (65865656856).
The spelling of 11224314645 in words is "eleven billion, two hundred twenty-four million, three hundred fourteen thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •