Base | Representation |
---|---|
bin | 10100111010000010… |
… | …10110100110100111 |
3 | 1001222020112010202211 |
4 | 22131001112212213 |
5 | 140441410442411 |
6 | 5053435544251 |
7 | 545102036236 |
oct | 123501264647 |
9 | 31866463684 |
10 | 11224312231 |
11 | 483a916a00 |
12 | 2212bbb087 |
13 | 109b544a92 |
14 | 7869c0b1d |
15 | 45a5ec221 |
hex | 29d0569a7 |
11224312231 has 12 divisors (see below), whose sum is σ = 12624390856. Its totient is φ = 9966615120.
The previous prime is 11224312207. The next prime is 11224312249. The reversal of 11224312231 is 13221342211.
11224312231 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11224312231 - 25 = 11224312199 is a prime.
It is a super-2 number, since 2×112243122312 (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 (11224312331) 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 11 ways as a sum of consecutive naturals, for example, 1073436 + ... + 1083841.
Almost surely, 211224312231 is an apocalyptic number.
11224312231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11224312231 is a deficient number, since it is larger than the sum of its proper divisors (1400078625).
11224312231 is a wasteful number, since it uses less digits than its factorization.
11224312231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2157342 (or 2157331 counting only the distinct ones).
The product of its digits is 576, while the sum is 22.
Adding to 11224312231 its reverse (13221342211), we get a palindrome (24445654442).
The spelling of 11224312231 in words is "eleven billion, two hundred twenty-four million, three hundred twelve thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •