Base | Representation |
---|---|
bin | 1010000001100000111000… |
… | …1000100111011011101110 |
3 | 1110000121110000201111102110 |
4 | 2200120032020213123232 |
5 | 2421032230021034410 |
6 | 35235011211304450 |
7 | 2215151464456563 |
oct | 240301610473356 |
9 | 43017400644373 |
10 | 11021123221230 |
11 | 356a039813741 |
12 | 129bb73a4b126 |
13 | 61c397720025 |
14 | 2a15d4ac286a |
15 | 141a40d46720 |
hex | a060e2276ee |
11021123221230 has 16 divisors (see below), whose sum is σ = 26450695731024. Its totient is φ = 2938966192320.
The previous prime is 11021123221181. The next prime is 11021123221237. The reversal of 11021123221230 is 3212232112011.
It is a junction number, because it is equal to n+sod(n) for n = 11021123221197 and 11021123221206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11021123221237) 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, 183685386991 + ... + 183685387050.
It is an arithmetic number, because the mean of its divisors is an integer number (1653168483189).
Almost surely, 211021123221230 is an apocalyptic number.
11021123221230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11021123221230 is an abundant number, since it is smaller than the sum of its proper divisors (15429572509794).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11021123221230 is a wasteful number, since it uses less digits than its factorization.
11021123221230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 367370774051.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 11021123221230 its reverse (3212232112011), we get a palindrome (14233355333241).
The spelling of 11021123221230 in words is "eleven trillion, twenty-one billion, one hundred twenty-three million, two hundred twenty-one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •