Base | Representation |
---|---|
bin | 1010000001011100110100… |
… | …1010100001011111001011 |
3 | 1110000111122001122210022102 |
4 | 2200113031022201133023 |
5 | 2421023011444431443 |
6 | 35234311112344015 |
7 | 2215112460453401 |
oct | 240271512413713 |
9 | 43014561583272 |
10 | 11020033202123 |
11 | 356962a4a6200 |
12 | 129b90a9a500b |
13 | 61c2529552ca |
14 | 2a1530021471 |
15 | 1419ca2d2cb8 |
hex | a05cd2a17cb |
11020033202123 has 12 divisors (see below), whose sum is σ = 12114018753144. Its totient is φ = 10017310749600.
The previous prime is 11020033202107. The next prime is 11020033202149. The reversal of 11020033202123 is 32120233002011.
It is not a de Polignac number, because 11020033202123 - 24 = 11020033202107 is a prime.
It is a super-2 number, since 2×110200332021232 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11020033202095 and 11020033202104.
It is not an unprimeable number, because it can be changed into a prime (11020033202023) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2744186 + ... + 5437887.
It is an arithmetic number, because the mean of its divisors is an integer number (1009501562762).
Almost surely, 211020033202123 is an apocalyptic number.
11020033202123 is a deficient number, since it is larger than the sum of its proper divisors (1093985551021).
11020033202123 is a wasteful number, since it uses less digits than its factorization.
11020033202123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8193226 (or 8193215 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 11020033202123 its reverse (32120233002011), we get a palindrome (43140266204134).
The spelling of 11020033202123 in words is "eleven trillion, twenty billion, thirty-three million, two hundred two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •