Base | Representation |
---|---|
bin | 1010000010101000101111… |
… | …1110001111111110101001 |
3 | 1110002110020110021221110220 |
4 | 2200222023332033332221 |
5 | 2421341232030131441 |
6 | 35251521334200253 |
7 | 2216433521114121 |
oct | 240521376177651 |
9 | 43073213257426 |
10 | 11040414302121 |
11 | 35772390612a6 |
12 | 12a38584b3089 |
13 | 6211502849a9 |
14 | 2a2504b8bc81 |
15 | 1422be72c466 |
hex | a0a8bf8ffa9 |
11040414302121 has 8 divisors (see below), whose sum is σ = 15118405170624. Its totient is φ = 7161349817520.
The previous prime is 11040414302087. The next prime is 11040414302147. The reversal of 11040414302121 is 12120341404011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11040414302121 - 211 = 11040414300073 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11040414302091 and 11040414302100.
It is not an unprimeable number, because it can be changed into a prime (11040414372121) 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, 49731595845 + ... + 49731596066.
It is an arithmetic number, because the mean of its divisors is an integer number (1889800646328).
Almost surely, 211040414302121 is an apocalyptic number.
It is an amenable number.
11040414302121 is a deficient number, since it is larger than the sum of its proper divisors (4077990868503).
11040414302121 is an equidigital number, since it uses as much as digits as its factorization.
11040414302121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99463191951.
The product of its (nonzero) digits is 768, while the sum is 24.
Adding to 11040414302121 its reverse (12120341404011), we get a palindrome (23160755706132).
The spelling of 11040414302121 in words is "eleven trillion, forty billion, four hundred fourteen million, three hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •