Base | Representation |
---|---|
bin | 10100101011010101… |
… | …11111100111100101 |
3 | 1001122122111202110112 |
4 | 22111222333213211 |
5 | 140213324313110 |
6 | 5033313102405 |
7 | 542044013552 |
oct | 122552774745 |
9 | 31578452415 |
10 | 11101010405 |
11 | 478725a471 |
12 | 2199857a05 |
13 | 107bb33014 |
14 | 774485a29 |
15 | 44e893405 |
hex | 295abf9e5 |
11101010405 has 8 divisors (see below), whose sum is σ = 13343680152. Its totient is φ = 8865829888.
The previous prime is 11101010381. The next prime is 11101010407. The reversal of 11101010405 is 50401010111.
It can be written as a sum of positive squares in 4 ways, for example, as 1342929316 + 9758081089 = 36646^2 + 98783^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11101010405 - 26 = 11101010341 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11101010405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11101010407) 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, 1869044 + ... + 1874973.
It is an arithmetic number, because the mean of its divisors is an integer number (1667960019).
Almost surely, 211101010405 is an apocalyptic number.
It is an amenable number.
11101010405 is a deficient number, since it is larger than the sum of its proper divisors (2242669747).
11101010405 is an equidigital number, since it uses as much as digits as its factorization.
11101010405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3744615.
The product of its (nonzero) digits is 20, while the sum is 14.
Adding to 11101010405 its reverse (50401010111), we get a palindrome (61502020516).
The spelling of 11101010405 in words is "eleven billion, one hundred one million, ten thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •