Base | Representation |
---|---|
bin | 1010000000011110001100… |
… | …0010000000111001001001 |
3 | 1102221220020100000211200100 |
4 | 2200013203002000321021 |
5 | 2420234043332413113 |
6 | 35222450511400013 |
7 | 2213646024350454 |
oct | 240074302007111 |
9 | 42856210024610 |
10 | 11003220201033 |
11 | 3562491a4a685 |
12 | 12985b8223009 |
13 | 61a7a3616658 |
14 | 2a07b70dc49b |
15 | 141344247d73 |
hex | a01e3080e49 |
11003220201033 has 24 divisors (see below), whose sum is σ = 15963470415360. Its totient is φ = 7303217886720.
The previous prime is 11003220200927. The next prime is 11003220201067. The reversal of 11003220201033 is 33010202230011.
11003220201033 is a `hidden beast` number, since 110 + 0 + 322 + 0 + 201 + 0 + 33 = 666.
It is not a de Polignac number, because 11003220201033 - 210 = 11003220200009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11003220200997 and 11003220201015.
It is not an unprimeable number, because it can be changed into a prime (11003220201133) 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, 9504288 + ... + 10598958.
It is an arithmetic number, because the mean of its divisors is an integer number (665144600640).
Almost surely, 211003220201033 is an apocalyptic number.
It is an amenable number.
11003220201033 is a deficient number, since it is larger than the sum of its proper divisors (4960250214327).
11003220201033 is a wasteful number, since it uses less digits than its factorization.
11003220201033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1099589 (or 1099586 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 11003220201033 its reverse (33010202230011), we get a palindrome (44013422431044).
The spelling of 11003220201033 in words is "eleven trillion, three billion, two hundred twenty million, two hundred one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •