Base | Representation |
---|---|
bin | 1010000111100001011100… |
… | …0101000110100111010110 |
3 | 1110101110220020211201122120 |
4 | 2201320113011012213112 |
5 | 2424230133220313142 |
6 | 35354242413240410 |
7 | 2225464553113434 |
oct | 241702705064726 |
9 | 43343806751576 |
10 | 11124352510422 |
11 | 35a98a1a87588 |
12 | 12b7b83193106 |
13 | 629039284878 |
14 | 2a65c8993d54 |
15 | 1445838177ec |
hex | a1e171469d6 |
11124352510422 has 16 divisors (see below), whose sum is σ = 22249376550912. Its totient is φ = 3708005581800.
The previous prime is 11124352510421. The next prime is 11124352510423. The reversal of 11124352510422 is 22401525342111.
It is an interprime number because it is at equal distance from previous prime (11124352510421) and next prime (11124352510423).
It is a super-2 number, since 2×111243525104222 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11124352510421) 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, 27764938 + ... + 28162749.
It is an arithmetic number, because the mean of its divisors is an integer number (1390586034432).
Almost surely, 211124352510422 is an apocalyptic number.
11124352510422 is an abundant number, since it is smaller than the sum of its proper divisors (11125024040490).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11124352510422 is a wasteful number, since it uses less digits than its factorization.
11124352510422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55960843.
The product of its (nonzero) digits is 19200, while the sum is 33.
Adding to 11124352510422 its reverse (22401525342111), we get a palindrome (33525877852533).
The spelling of 11124352510422 in words is "eleven trillion, one hundred twenty-four billion, three hundred fifty-two million, five hundred ten thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •