Base | Representation |
---|---|
bin | 11001010001001011110000… |
… | …110001000110011111110101 |
3 | 112120111010011202221200120220 |
4 | 121101023300301012133311 |
5 | 104031241340421021323 |
6 | 1032205202514044553 |
7 | 32260011064235262 |
oct | 3121136061063765 |
9 | 476433152850526 |
10 | 111132023220213 |
11 | 3245690a9a1536 |
12 | 1056a169879759 |
13 | 4a01921658c38 |
14 | 1d62b66434269 |
15 | ccabeb73a0e3 |
hex | 6512f0c467f5 |
111132023220213 has 64 divisors (see below), whose sum is σ = 158990730370560. Its totient is φ = 68893203456000.
The previous prime is 111132023220103. The next prime is 111132023220221. The reversal of 111132023220213 is 312022320231111.
It is not a de Polignac number, because 111132023220213 - 230 = 111130949478389 is a prime.
It is a super-3 number, since 3×1111320232202133 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111132023220263) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 183669145 + ... + 184273217.
It is an arithmetic number, because the mean of its divisors is an integer number (2484230162040).
Almost surely, 2111132023220213 is an apocalyptic number.
It is an amenable number.
111132023220213 is a deficient number, since it is larger than the sum of its proper divisors (47858707150347).
111132023220213 is a wasteful number, since it uses less digits than its factorization.
111132023220213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 604670.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 111132023220213 its reverse (312022320231111), we get a palindrome (423154343451324).
The spelling of 111132023220213 in words is "one hundred eleven trillion, one hundred thirty-two billion, twenty-three million, two hundred twenty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •