Base | Representation |
---|---|
bin | 1010000001011110001100… |
… | …0011000001000100110111 |
3 | 1110000112120122110222100102 |
4 | 2200113203003001010313 |
5 | 2421024234441124421 |
6 | 35234411345304315 |
7 | 2215124536150211 |
oct | 240274303010467 |
9 | 43015518428312 |
10 | 11020400333111 |
11 | 35697a8761144 |
12 | 129b9b193509b |
13 | 61c2b0a28a90 |
14 | 2a1566aab5b1 |
15 | 1419ec65260b |
hex | a05e30c1137 |
11020400333111 has 4 divisors (see below), whose sum is σ = 11868123435672. Its totient is φ = 10172677230552.
The previous prime is 11020400333099. The next prime is 11020400333119. The reversal of 11020400333111 is 11133300402011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11020400333111 is a prime.
It is a super-4 number, since 4×110204003331114 (a number of 53 digits) contains 4444 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11020400333119) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 423861551261 + ... + 423861551286.
It is an arithmetic number, because the mean of its divisors is an integer number (2967030858918).
Almost surely, 211020400333111 is an apocalyptic number.
11020400333111 is a deficient number, since it is larger than the sum of its proper divisors (847723102561).
11020400333111 is an equidigital number, since it uses as much as digits as its factorization.
11020400333111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 847723102560.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 11020400333111 its reverse (11133300402011), we get a palindrome (22153700735122).
The spelling of 11020400333111 in words is "eleven trillion, twenty billion, four hundred million, three hundred thirty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •