Base | Representation |
---|---|
bin | 1010001100100101000000… |
… | …1100001000111100101111 |
3 | 1110200210002111112110221100 |
4 | 2203021100030020330233 |
5 | 2432141024230032343 |
6 | 35502205254534143 |
7 | 2234661143446500 |
oct | 243112014107457 |
9 | 43623074473840 |
10 | 11211210002223 |
11 | 3632713852760 |
12 | 1310983667353 |
13 | 63429c01772a |
14 | 2aa8a8390ba7 |
15 | 146968d509d3 |
hex | a3250308f2f |
11211210002223 has 144 divisors (see below), whose sum is σ = 20860862480640. Its totient is φ = 5736595737600.
The previous prime is 11211210002203. The next prime is 11211210002341. The reversal of 11211210002223 is 32220001211211.
It is not a de Polignac number, because 11211210002223 - 29 = 11211210001711 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11211210002196 and 11211210002205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11211210002203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 99228958 + ... + 99341876.
It is an arithmetic number, because the mean of its divisors is an integer number (144867100560).
Almost surely, 211211210002223 is an apocalyptic number.
11211210002223 is a deficient number, since it is larger than the sum of its proper divisors (9649652478417).
11211210002223 is a wasteful number, since it uses less digits than its factorization.
11211210002223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113258 (or 113248 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 11211210002223 its reverse (32220001211211), we get a palindrome (43431211213434).
The spelling of 11211210002223 in words is "eleven trillion, two hundred eleven billion, two hundred ten million, two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.087 sec. • engine limits •