Base | Representation |
---|---|
bin | 1010000110110100100101… |
… | …1010111101101101010111 |
3 | 1110100022211010212120211101 |
4 | 2201231021122331231113 |
5 | 2424031003410400043 |
6 | 35344531543450531 |
7 | 2224560312136606 |
oct | 241551132755527 |
9 | 43308733776741 |
10 | 11112312200023 |
11 | 35a47835a3131 |
12 | 12b5782a56a47 |
13 | 627b6a978148 |
14 | 2a5ba5881a3d |
15 | 1440cb78324d |
hex | a1b496bdb57 |
11112312200023 has 8 divisors (see below), whose sum is σ = 11119383578160. Its totient is φ = 11105241638400.
The previous prime is 11112312199991. The next prime is 11112312200107. The reversal of 11112312200023 is 32000221321111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11112312200023 - 25 = 11112312199991 is a prime.
It is a super-2 number, since 2×111123122000232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11112312200723) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28282743 + ... + 28672951.
It is an arithmetic number, because the mean of its divisors is an integer number (1389922947270).
Almost surely, 211112312200023 is an apocalyptic number.
11112312200023 is a deficient number, since it is larger than the sum of its proper divisors (7071378137).
11112312200023 is a wasteful number, since it uses less digits than its factorization.
11112312200023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 408257.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 11112312200023 its reverse (32000221321111), we get a palindrome (43112533521134).
The spelling of 11112312200023 in words is "eleven trillion, one hundred twelve billion, three hundred twelve million, two hundred thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •