Base | Representation |
---|---|
bin | 1010000110000111100011… |
… | …0010100011101100110101 |
3 | 1110022011121120001102001200 |
4 | 2201201320302203230311 |
5 | 2423331223313342323 |
6 | 35335212133043113 |
7 | 2223651564215625 |
oct | 241417062435465 |
9 | 43264546042050 |
10 | 11100222012213 |
11 | 359a639a42084 |
12 | 12b3369a86499 |
13 | 626991c27069 |
14 | 2a5379ca8885 |
15 | 143b2014a443 |
hex | a1878ca3b35 |
11100222012213 has 6 divisors (see below), whose sum is σ = 16033654017654. Its totient is φ = 7400148008136.
The previous prime is 11100222012197. The next prime is 11100222012223. The reversal of 11100222012213 is 31221022200111.
It can be written as a sum of positive squares in only one way, i.e., 7317014180004 + 3783207832209 = 2704998^2 + 1945047^2 .
It is not a de Polignac number, because 11100222012213 - 24 = 11100222012197 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11100222012223) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 616679000670 + ... + 616679000687.
It is an arithmetic number, because the mean of its divisors is an integer number (2672275669609).
Almost surely, 211100222012213 is an apocalyptic number.
It is an amenable number.
11100222012213 is a deficient number, since it is larger than the sum of its proper divisors (4933432005441).
11100222012213 is a wasteful number, since it uses less digits than its factorization.
11100222012213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1233358001363 (or 1233358001360 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 11100222012213 its reverse (31221022200111), we get a palindrome (42321244212324).
The spelling of 11100222012213 in words is "eleven trillion, one hundred billion, two hundred twenty-two million, twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •