Base | Representation |
---|---|
bin | 1010001000011111011101… |
… | …1110101000101110110001 |
3 | 1110110001212121011200210102 |
4 | 2202013313132220232301 |
5 | 2430013233030431113 |
6 | 35410034502042145 |
7 | 2226624264134414 |
oct | 242076736505661 |
9 | 43401777150712 |
10 | 11141002202033 |
11 | 36059663302a0 |
12 | 12bb24b119355 |
13 | 62a7908145b2 |
14 | 2a7327d25b7b |
15 | 144c0a394758 |
hex | a21f77a8bb1 |
11141002202033 has 32 divisors (see below), whose sum is σ = 12431674281600. Its totient is φ = 9899180605440.
The previous prime is 11141002202009. The next prime is 11141002202039. The reversal of 11141002202033 is 33020220014111.
It is a cyclic number.
It is not a de Polignac number, because 11141002202033 - 212 = 11141002197937 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11141002201996 and 11141002202014.
It is not an unprimeable number, because it can be changed into a prime (11141002202039) 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, 757935518 + ... + 757950216.
It is an arithmetic number, because the mean of its divisors is an integer number (388489821300).
Almost surely, 211141002202033 is an apocalyptic number.
It is an amenable number.
11141002202033 is a deficient number, since it is larger than the sum of its proper divisors (1290672079567).
11141002202033 is a wasteful number, since it uses less digits than its factorization.
11141002202033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23249.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 11141002202033 its reverse (33020220014111), we get a palindrome (44161222216144).
It can be divided in two parts, 1114100 and 2202033, that added together give a palindrome (3316133).
The spelling of 11141002202033 in words is "eleven trillion, one hundred forty-one billion, two million, two hundred two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •