Base | Representation |
---|---|
bin | 1010001100100100101011… |
… | …1101111111001001000000 |
3 | 1110200202212101201010110000 |
4 | 2203021022331333021000 |
5 | 2432140334313442302 |
6 | 35502152445240000 |
7 | 2234656031055000 |
oct | 243111275771100 |
9 | 43622771633400 |
10 | 11211122405952 |
11 | 3632679363347 |
12 | 131095a263000 |
13 | 634286b27911 |
14 | 2aa89a8ac000 |
15 | 1469612eb31c |
hex | a324af7f240 |
11211122405952 has 280 divisors, whose sum is σ = 38756016569600. Its totient is φ = 3203177322240.
The previous prime is 11211122405893. The next prime is 11211122405957. The reversal of 11211122405952 is 25950422111211.
11211122405952 is a `hidden beast` number, since 1 + 1 + 2 + 1 + 1 + 1 + 22 + 40 + 595 + 2 = 666.
It is a super-2 number, since 2×112111224059522 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (11211122405957) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 1374424 + ... + 4930647.
Almost surely, 211211122405952 is an apocalyptic number.
11211122405952 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11211122405952 is an abundant number, since it is smaller than the sum of its proper divisors (27544894163648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11211122405952 is an frugal number, since it uses more digits than its factorization.
11211122405952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6305116 (or 6305083 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 36.
The spelling of 11211122405952 in words is "eleven trillion, two hundred eleven billion, one hundred twenty-two million, four hundred five thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •