Base | Representation |
---|---|
bin | 10100101100011010… |
… | …11100010110110101 |
3 | 1001200021111120010111 |
4 | 22112031130112311 |
5 | 140223132303023 |
6 | 5034234423021 |
7 | 542213535061 |
oct | 122615342665 |
9 | 31607446114 |
10 | 11110041013 |
11 | 4791368285 |
12 | 21a0891a71 |
13 | 1080975586 |
14 | 775756aa1 |
15 | 45057900d |
hex | 29635c5b5 |
11110041013 has 4 divisors (see below), whose sum is σ = 11213873280. Its totient is φ = 11006208748.
The previous prime is 11110041001. The next prime is 11110041017. The reversal of 11110041013 is 31014001111.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 11110041013 - 225 = 11076486581 is a prime.
It is a super-2 number, since 2×111100410132 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11110040984 and 11110041002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11110041017) 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, 51915973 + ... + 51916186.
It is an arithmetic number, because the mean of its divisors is an integer number (2803468320).
Almost surely, 211110041013 is an apocalyptic number.
It is an amenable number.
11110041013 is a deficient number, since it is larger than the sum of its proper divisors (103832267).
11110041013 is a wasteful number, since it uses less digits than its factorization.
11110041013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 103832266.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 11110041013 its reverse (31014001111), we get a palindrome (42124042124).
The spelling of 11110041013 in words is "eleven billion, one hundred ten million, forty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •