Base | Representation |
---|---|
bin | 10100110001101010… |
… | …01011110100010101 |
3 | 1001210100020120222200 |
4 | 22120311023310111 |
5 | 140320411412321 |
6 | 5042445115113 |
7 | 543256356453 |
oct | 123065136425 |
9 | 31710216880 |
10 | 11154013461 |
11 | 4804171448 |
12 | 21b3558a99 |
13 | 1089b00286 |
14 | 77b5219d3 |
15 | 454362d26 |
hex | 298d4bd15 |
11154013461 has 24 divisors (see below), whose sum is σ = 16818285120. Its totient is φ = 7109980416.
The previous prime is 11154013459. The next prime is 11154013501. The reversal of 11154013461 is 16431045111.
11154013461 is a `hidden beast` number, since 111 + 540 + 1 + 3 + 4 + 6 + 1 = 666.
11154013461 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11154013461 - 21 = 11154013459 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11154013411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 626085 + ... + 643653.
It is an arithmetic number, because the mean of its divisors is an integer number (700761880).
Almost surely, 211154013461 is an apocalyptic number.
It is an amenable number.
11154013461 is a deficient number, since it is larger than the sum of its proper divisors (5664271659).
11154013461 is a wasteful number, since it uses less digits than its factorization.
11154013461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20665 (or 20662 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 27.
Adding to 11154013461 its reverse (16431045111), we get a palindrome (27585058572).
The spelling of 11154013461 in words is "eleven billion, one hundred fifty-four million, thirteen thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •