Base | Representation |
---|---|
bin | 1001100110011010101011… |
… | …10001100010110110111001 |
3 | 2202202012201001112102221011 |
4 | 10303031111301202312321 |
5 | 10231341221021423113 |
6 | 112522204121313521 |
7 | 4306143204226543 |
oct | 463152561426671 |
9 | 82665631472834 |
10 | 21111203311033 |
11 | 67aa2359a0470 |
12 | 244b5ab3358a1 |
13 | ba1a1615ca24 |
14 | 52db055da693 |
15 | 26923e18663d |
hex | 133355c62db9 |
21111203311033 has 8 divisors (see below), whose sum is σ = 23062886559360. Its totient is φ = 19164933887280.
The previous prime is 21111203311031. The next prime is 21111203311069. The reversal of 21111203311033 is 33011330211112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21111203311033 - 21 = 21111203311031 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21111203310995 and 21111203311013.
It is not an unprimeable number, because it can be changed into a prime (21111203311031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1353447985 + ... + 1353463582.
It is an arithmetic number, because the mean of its divisors is an integer number (2882860819920).
Almost surely, 221111203311033 is an apocalyptic number.
It is an amenable number.
21111203311033 is a deficient number, since it is larger than the sum of its proper divisors (1951683248327).
21111203311033 is a wasteful number, since it uses less digits than its factorization.
21111203311033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2706912287.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 21111203311033 its reverse (33011330211112), we get a palindrome (54122533522145).
The spelling of 21111203311033 in words is "twenty-one trillion, one hundred eleven billion, two hundred three million, three hundred eleven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •