Base | Representation |
---|---|
bin | 1010001100001010100100… |
… | …0001101100000010110111 |
3 | 1110200002202201120101210102 |
4 | 2203002221001230002313 |
5 | 2432032004242000043 |
6 | 35455033003544315 |
7 | 2234320205620400 |
oct | 243025101540267 |
9 | 43602681511712 |
10 | 11204110500023 |
11 | 362a700317671 |
12 | 130b521b2b09b |
13 | 63370a21375c |
14 | 2aa3d35329a7 |
15 | 1466a092e6b8 |
hex | a30a906c0b7 |
11204110500023 has 24 divisors (see below), whose sum is σ = 13720020566400. Its totient is φ = 9097609430448.
The previous prime is 11204110499977. The next prime is 11204110500073. The reversal of 11204110500023 is 32000501140211.
It is not a de Polignac number, because 11204110500023 - 212 = 11204110495927 is a prime.
It is a super-3 number, since 3×112041105000233 (a number of 40 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11204110499968 and 11204110500004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11204110500073) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 18526286 + ... + 19121492.
It is an arithmetic number, because the mean of its divisors is an integer number (571667523600).
Almost surely, 211204110500023 is an apocalyptic number.
11204110500023 is a deficient number, since it is larger than the sum of its proper divisors (2515910066377).
11204110500023 is a wasteful number, since it uses less digits than its factorization.
11204110500023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 615459 (or 615452 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 20.
Adding to 11204110500023 its reverse (32000501140211), we get a palindrome (43204611640234).
The spelling of 11204110500023 in words is "eleven trillion, two hundred four billion, one hundred ten million, five hundred thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •