Base | Representation |
---|---|
bin | 1010000000010010111110… |
… | …1011100101110011000101 |
3 | 1102221121110122001210220212 |
4 | 2200010233223211303011 |
5 | 2420211413031414341 |
6 | 35221232142205205 |
7 | 2213511326312324 |
oct | 240045753456305 |
9 | 42847418053825 |
10 | 11000211201221 |
11 | 35611884a2580 |
12 | 1297ab8583805 |
13 | 61a4141008a8 |
14 | 2a05ad6320bb |
15 | 141219ec75eb |
hex | a012fae5cc5 |
11000211201221 has 16 divisors (see below), whose sum is σ = 12522252354048. Its totient is φ = 9565192652400.
The previous prime is 11000211201211. The next prime is 11000211201223. The reversal of 11000211201221 is 12210211200011.
It is not a de Polignac number, because 11000211201221 - 26 = 11000211201157 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11000211201196 and 11000211201205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11000211201223) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11788430 + ... + 12687296.
It is an arithmetic number, because the mean of its divisors is an integer number (782640772128).
Almost surely, 211000211201221 is an apocalyptic number.
11000211201221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11000211201221 is a deficient number, since it is larger than the sum of its proper divisors (1522041152827).
11000211201221 is a wasteful number, since it uses less digits than its factorization.
11000211201221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 947272.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11000211201221 its reverse (12210211200011), we get a palindrome (23210422401232).
The spelling of 11000211201221 in words is "eleven trillion, two hundred eleven million, two hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •