Base | Representation |
---|---|
bin | 1010001101001010010110… |
… | …1000011100111111011100 |
3 | 1110201201222001100222100222 |
4 | 2203102211220130333130 |
5 | 2432322041224003200 |
6 | 35510544035340512 |
7 | 2235464424223526 |
oct | 243224550347734 |
9 | 43651861328328 |
10 | 11221233422300 |
11 | 3636997803600 |
12 | 1312900451738 |
13 | 635208814c25 |
14 | 2ab17968ca16 |
15 | 146d53cd7d85 |
hex | a34a5a1cfdc |
11221233422300 has 54 divisors (see below), whose sum is σ = 26764960177704. Its totient is φ = 4080448512800.
The previous prime is 11221233422293. The next prime is 11221233422323. The reversal of 11221233422300 is 322433212211.
It is a self number, because there is not a number n which added to its sum of digits gives 11221233422300.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 463675232 + ... + 463699431.
Almost surely, 211221233422300 is an apocalyptic number.
11221233422300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11221233422300 is an abundant number, since it is smaller than the sum of its proper divisors (15543726755404).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11221233422300 is a wasteful number, since it uses less digits than its factorization.
11221233422300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 927374699 (or 927374681 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 11221233422300 its reverse (322433212211), we get a palindrome (11543666634511).
The spelling of 11221233422300 in words is "eleven trillion, two hundred twenty-one billion, two hundred thirty-three million, four hundred twenty-two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.330 sec. • engine limits •