Base | Representation |
---|---|
bin | 10101000011100010… |
… | …10001010101011111 |
3 | 1002011210102210201222 |
4 | 22201301101111133 |
5 | 141122304414211 |
6 | 5105403323555 |
7 | 550060160000 |
oct | 124161212537 |
9 | 32153383658 |
10 | 11303982431 |
11 | 4880892345 |
12 | 22358205bb |
13 | 10b1bbb001 |
14 | 7933dd1a7 |
15 | 4625d81db |
hex | 2a1c5155f |
11303982431 has 40 divisors (see below), whose sum is σ = 14571205344. Its totient is φ = 8721968640.
The previous prime is 11303982427. The next prime is 11303982433. The reversal of 11303982431 is 13428930311.
11303982431 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 11303982431 - 22 = 11303982427 is a prime.
It is a super-3 number, since 3×113039824313 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11303982391 and 11303982400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11303982433) 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 39 ways as a sum of consecutive naturals, for example, 932771 + ... + 944811.
Almost surely, 211303982431 is an apocalyptic number.
11303982431 is a deficient number, since it is larger than the sum of its proper divisors (3267222913).
11303982431 is an equidigital number, since it uses as much as digits as its factorization.
11303982431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12109 (or 12088 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 35.
The spelling of 11303982431 in words is "eleven billion, three hundred three million, nine hundred eighty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •