Base | Representation |
---|---|
bin | 1010000110000111100000… |
… | …1100010111110011100111 |
3 | 1110022011120212012211122220 |
4 | 2201201320030113303213 |
5 | 2423331213233031043 |
6 | 35335211134323423 |
7 | 2223651413144454 |
oct | 241417014276347 |
9 | 43264525184586 |
10 | 11100212002023 |
11 | 359a6343252a1 |
12 | 12b3366659573 |
13 | 62698cb30981 |
14 | 2a537882082b |
15 | 143b1e31e483 |
hex | a1878317ce7 |
11100212002023 has 32 divisors (see below), whose sum is σ = 15799276823040. Its totient is φ = 6911653432320.
The previous prime is 11100212002021. The next prime is 11100212002027. The reversal of 11100212002023 is 32020021200111.
11100212002023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11100212002023 - 21 = 11100212002021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11100212001993 and 11100212002011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11100212002021) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 193162911 + ... + 193220367.
It is an arithmetic number, because the mean of its divisors is an integer number (493727400720).
Almost surely, 211100212002023 is an apocalyptic number.
11100212002023 is a deficient number, since it is larger than the sum of its proper divisors (4699064821017).
11100212002023 is a wasteful number, since it uses less digits than its factorization.
11100212002023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 105287.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 11100212002023 its reverse (32020021200111), we get a palindrome (43120233202134).
The spelling of 11100212002023 in words is "eleven trillion, one hundred billion, two hundred twelve million, two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •