Base | Representation |
---|---|
bin | 10100111001110100… |
… | …01011011001101101 |
3 | 1001222002222120200020 |
4 | 22130322023121231 |
5 | 140440420300331 |
6 | 5053331352353 |
7 | 545050043502 |
oct | 123472133155 |
9 | 31862876606 |
10 | 11222431341 |
11 | 4839851850 |
12 | 22124526b9 |
13 | 109b036924 |
14 | 7866514a9 |
15 | 45a379c96 |
hex | 29ce8b66d |
11222431341 has 16 divisors (see below), whose sum is σ = 16325342208. Its totient is φ = 6800721200.
The previous prime is 11222431321. The next prime is 11222431349. The reversal of 11222431341 is 14313422211.
It is a cyclic number.
It is not a de Polignac number, because 11222431341 - 221 = 11220334189 is a prime.
It is a super-3 number, since 3×112224313413 (a number of 31 digits) contains 333 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11222431349) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 487276 + ... + 509786.
It is an arithmetic number, because the mean of its divisors is an integer number (1020333888).
Almost surely, 211222431341 is an apocalyptic number.
11222431341 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11222431341 is a deficient number, since it is larger than the sum of its proper divisors (5102910867).
11222431341 is a wasteful number, since it uses less digits than its factorization.
11222431341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37632.
The product of its digits is 1152, while the sum is 24.
Adding to 11222431341 its reverse (14313422211), we get a palindrome (25535853552).
The spelling of 11222431341 in words is "eleven billion, two hundred twenty-two million, four hundred thirty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •