Base | Representation |
---|---|
bin | 1010000110001110001011… |
… | …0101101010001101101111 |
3 | 1110022100012112221000220021 |
4 | 2201203202311222031233 |
5 | 2423343344302211343 |
6 | 35340104451303011 |
7 | 2224043640154060 |
oct | 241434265521557 |
9 | 43270175830807 |
10 | 11102001210223 |
11 | 35a0372288960 |
12 | 12b37858aaa67 |
13 | 626bb6712951 |
14 | 2a54a82c8567 |
15 | 143bc64450ed |
hex | a18e2d6a36f |
11102001210223 has 32 divisors (see below), whose sum is σ = 14656012190208. Its totient is φ = 8141836953600.
The previous prime is 11102001210187. The next prime is 11102001210227. The reversal of 11102001210223 is 32201210020111.
It is not a de Polignac number, because 11102001210223 - 225 = 11101967655791 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11102001210197 and 11102001210206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11102001210227) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 75884263 + ... + 76030423.
It is an arithmetic number, because the mean of its divisors is an integer number (458000380944).
Almost surely, 211102001210223 is an apocalyptic number.
11102001210223 is a deficient number, since it is larger than the sum of its proper divisors (3554010979985).
11102001210223 is a wasteful number, since it uses less digits than its factorization.
11102001210223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 204223.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 11102001210223 its reverse (32201210020111), we get a palindrome (43303211230334).
The spelling of 11102001210223 in words is "eleven trillion, one hundred two billion, one million, two hundred ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •