Base | Representation |
---|---|
bin | 1010000000011010000001… |
… | …1101011000000001111111 |
3 | 1102221210100111101101210200 |
4 | 2200012200131120001333 |
5 | 2420224301421101343 |
6 | 35222144012334543 |
7 | 2213606243014050 |
oct | 240064035300177 |
9 | 42853314341720 |
10 | 11002103300223 |
11 | 3561a69541562 |
12 | 1298346174453 |
13 | 61a6560c90b9 |
14 | 2a070ca40727 |
15 | 1412cb1744d3 |
hex | a01a075807f |
11002103300223 has 24 divisors (see below), whose sum is σ = 18951863244288. Its totient is φ = 6013571989392.
The previous prime is 11002103300179. The next prime is 11002103300249. The reversal of 11002103300223 is 32200330120011.
11002103300223 is a `hidden beast` number, since 1 + 100 + 2 + 10 + 330 + 0 + 223 = 666.
It is not a de Polignac number, because 11002103300223 - 210 = 11002103299199 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11002103300196 and 11002103300205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11002103304223) 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, 3796445515 + ... + 3796448412.
It is an arithmetic number, because the mean of its divisors is an integer number (789660968512).
Almost surely, 211002103300223 is an apocalyptic number.
11002103300223 is a deficient number, since it is larger than the sum of its proper divisors (7949759944065).
11002103300223 is a wasteful number, since it uses less digits than its factorization.
11002103300223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7592893963 (or 7592893960 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 11002103300223 its reverse (32200330120011), we get a palindrome (43202433420234).
The spelling of 11002103300223 in words is "eleven trillion, two billion, one hundred three million, three hundred thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •