Base | Representation |
---|---|
bin | 10100101101110000… |
… | …11001101110110011 |
3 | 1001201001200200220210 |
4 | 22112320121232303 |
5 | 140234023134301 |
6 | 5035320035203 |
7 | 542411340210 |
oct | 122670315663 |
9 | 31631620823 |
10 | 11121302451 |
11 | 479775a156 |
12 | 21a4602b03 |
13 | 10830b934c |
14 | 777048b07 |
15 | 451550ad6 |
hex | 296e19bb3 |
11121302451 has 8 divisors (see below), whose sum is σ = 16946746624. Its totient is φ = 6355029960.
The previous prime is 11121302429. The next prime is 11121302453. The reversal of 11121302451 is 15420312111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11121302451 - 27 = 11121302323 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 529585831 = 11121302451 / (1 + 1 + 1 + 2 + 1 + 3 + 0 + 2 + 4 + 5 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11121302453) 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 7 ways as a sum of consecutive naturals, for example, 264792895 + ... + 264792936.
It is an arithmetic number, because the mean of its divisors is an integer number (2118343328).
Almost surely, 211121302451 is an apocalyptic number.
11121302451 is a deficient number, since it is larger than the sum of its proper divisors (5825444173).
11121302451 is an equidigital number, since it uses as much as digits as its factorization.
11121302451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 529585841.
The product of its (nonzero) digits is 240, while the sum is 21.
Adding to 11121302451 its reverse (15420312111), we get a palindrome (26541614562).
The spelling of 11121302451 in words is "eleven billion, one hundred twenty-one million, three hundred two thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •