Base | Representation |
---|---|
bin | 1010001100101000000010… |
… | …1010101010111011110001 |
3 | 1110200212012011220220100212 |
4 | 2203022000222222323301 |
5 | 2432144210431441423 |
6 | 35502422110553505 |
7 | 2235020250456401 |
oct | 243120052527361 |
9 | 43625164826325 |
10 | 11212023312113 |
11 | 3632aa0954498 |
12 | 1310b6bb08895 |
13 | 63439b67a8a0 |
14 | 2aa9443c2801 |
15 | 1469b5456578 |
hex | a3280aaaef1 |
11212023312113 has 16 divisors (see below), whose sum is σ = 12116139724416. Its totient is φ = 10313886885120.
The previous prime is 11212023312107. The next prime is 11212023312157. The reversal of 11212023312113 is 31121332021211.
It is a happy number.
It is not a de Polignac number, because 11212023312113 - 28 = 11212023311857 is a prime.
It is a super-2 number, since 2×112120233121132 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11212023392113) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8511308 + ... + 9739938.
It is an arithmetic number, because the mean of its divisors is an integer number (757258732776).
Almost surely, 211212023312113 is an apocalyptic number.
11212023312113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11212023312113 is a deficient number, since it is larger than the sum of its proper divisors (904116412303).
11212023312113 is a wasteful number, since it uses less digits than its factorization.
11212023312113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1231064.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 11212023312113 its reverse (31121332021211), we get a palindrome (42333355333324).
The spelling of 11212023312113 in words is "eleven trillion, two hundred twelve billion, twenty-three million, three hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •