Base | Representation |
---|---|
bin | 1010000010001101010010… |
… | …0000101000101111110111 |
3 | 1110001202012121202201210202 |
4 | 2200203110200220233313 |
5 | 2421231132040411211 |
6 | 35244301554111115 |
7 | 2216053023020654 |
oct | 240432440505767 |
9 | 43052177681722 |
10 | 11033041341431 |
11 | 35740a522a85a |
12 | 12a233b27b49b |
13 | 620546916965 |
14 | 2a20058a8c2b |
15 | 141edc2e153b |
hex | a08d4828bf7 |
11033041341431 has 16 divisors (see below), whose sum is σ = 11410355404800. Its totient is φ = 10657068639840.
The previous prime is 11033041341397. The next prime is 11033041341437. The reversal of 11033041341431 is 13414314033011.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11033041341431 is a prime.
It is a super-2 number, since 2×110330413414312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11033041341394 and 11033041341403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11033041341437) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 303863780 + ... + 303900086.
It is an arithmetic number, because the mean of its divisors is an integer number (713147212800).
Almost surely, 211033041341431 is an apocalyptic number.
11033041341431 is a deficient number, since it is larger than the sum of its proper divisors (377314063369).
11033041341431 is a wasteful number, since it uses less digits than its factorization.
11033041341431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54494.
The product of its (nonzero) digits is 5184, while the sum is 29.
Adding to 11033041341431 its reverse (13414314033011), we get a palindrome (24447355374442).
The spelling of 11033041341431 in words is "eleven trillion, thirty-three billion, forty-one million, three hundred forty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •