Base | Representation |
---|---|
bin | 10100101011010111… |
… | …10101010101001101 |
3 | 1001122122220221020222 |
4 | 22111223311111031 |
5 | 140213403333123 |
6 | 5033321521125 |
7 | 542045621150 |
oct | 122553652515 |
9 | 31578827228 |
10 | 11101230413 |
11 | 478739a799 |
12 | 21999431a5 |
13 | 107bbac1c0 |
14 | 774501c97 |
15 | 44e8d86c8 |
hex | 295af554d |
11101230413 has 32 divisors (see below), whose sum is σ = 13841049600. Its totient is φ = 8669716416.
The previous prime is 11101230389. The next prime is 11101230443. The reversal of 11101230413 is 31403210111.
It is a cyclic number.
It is not a de Polignac number, because 11101230413 - 214 = 11101214029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11101230391 and 11101230400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11101230443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2261720 + ... + 2266622.
It is an arithmetic number, because the mean of its divisors is an integer number (432532800).
Almost surely, 211101230413 is an apocalyptic number.
11101230413 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11101230413 is a deficient number, since it is larger than the sum of its proper divisors (2739819187).
11101230413 is a wasteful number, since it uses less digits than its factorization.
11101230413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5241.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 11101230413 its reverse (31403210111), we get a palindrome (42504440524).
The spelling of 11101230413 in words is "eleven billion, one hundred one million, two hundred thirty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •