Base | Representation |
---|---|
bin | 10100110010101010… |
… | …11001001000110111 |
3 | 1001210221010112211200 |
4 | 22121111121020313 |
5 | 140330042103011 |
6 | 5043350103543 |
7 | 543421213224 |
oct | 123125311067 |
9 | 31727115750 |
10 | 11162456631 |
11 | 4808a08977 |
12 | 21b634abb3 |
13 | 108b798331 |
14 | 77c6bc94b |
15 | 454e7e856 |
hex | 299559237 |
11162456631 has 12 divisors (see below), whose sum is σ = 16271472360. Its totient is φ = 7373365200.
The previous prime is 11162456603. The next prime is 11162456633. The reversal of 11162456631 is 13665426111.
11162456631 is a `hidden beast` number, since 1 + 1 + 1 + 62 + 4 + 566 + 31 = 666.
11162456631 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 11162456631 - 26 = 11162456567 is a prime.
It is a super-2 number, since 2×111624566312 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11162456633) 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 11 ways as a sum of consecutive naturals, for example, 5688345 + ... + 5690306.
It is an arithmetic number, because the mean of its divisors is an integer number (1355956030).
Almost surely, 211162456631 is an apocalyptic number.
11162456631 is a deficient number, since it is larger than the sum of its proper divisors (5109015729).
11162456631 is a wasteful number, since it uses less digits than its factorization.
11162456631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11378766 (or 11378763 counting only the distinct ones).
The product of its digits is 25920, while the sum is 36.
The spelling of 11162456631 in words is "eleven billion, one hundred sixty-two million, four hundred fifty-six thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •