Base | Representation |
---|---|
bin | 1010001100100101000011… |
… | …0110111001011111110011 |
3 | 1110200210010021121221122210 |
4 | 2203021100312321133303 |
5 | 2432141040112223443 |
6 | 35502210335103203 |
7 | 2234661340642503 |
oct | 243112066713763 |
9 | 43623107557583 |
10 | 11211221211123 |
11 | 363271a10910a |
12 | 1310987371b03 |
13 | 6342a144060b |
14 | 2aa8a9a6ba03 |
15 | 146969d16c33 |
hex | a3250db97f3 |
11211221211123 has 32 divisors (see below), whose sum is σ = 15851801915392. Its totient is φ = 7035664924800.
The previous prime is 11211221211119. The next prime is 11211221211161. The reversal of 11211221211123 is 32111212211211.
It is not a de Polignac number, because 11211221211123 - 22 = 11211221211119 is a prime.
It is a super-2 number, since 2×112112212111232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11211221211123.
It is not an unprimeable number, because it can be changed into a prime (11211221211023) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 12408858 + ... + 13281648.
It is an arithmetic number, because the mean of its divisors is an integer number (495368809856).
Almost surely, 211211221211123 is an apocalyptic number.
11211221211123 is a deficient number, since it is larger than the sum of its proper divisors (4640580704269).
11211221211123 is a wasteful number, since it uses less digits than its factorization.
11211221211123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 876595.
The product of its digits is 96, while the sum is 21.
Adding to 11211221211123 its reverse (32111212211211), we get a palindrome (43322433422334).
The spelling of 11211221211123 in words is "eleven trillion, two hundred eleven billion, two hundred twenty-one million, two hundred eleven thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •