Base | Representation |
---|---|
bin | 10101011011011101… |
… | …01011111001111101 |
3 | 1002200202222211102001 |
4 | 22231232223321331 |
5 | 142030141201141 |
6 | 5141332102301 |
7 | 555044516323 |
oct | 125556537175 |
9 | 32622884361 |
10 | 11504631421 |
11 | 4974078958 |
12 | 2290a64991 |
13 | 111464181a |
14 | 7b1d0dd13 |
15 | 47501ea31 |
hex | 2adbabe7d |
11504631421 has 4 divisors (see below), whose sum is σ = 11519592700. Its totient is φ = 11489670144.
The previous prime is 11504631419. The next prime is 11504631449. The reversal of 11504631421 is 12413640511.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4165282521 + 7339348900 = 64539^2 + 85670^2 .
It is a cyclic number.
It is not a de Polignac number, because 11504631421 - 21 = 11504631419 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11504631421.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11504631121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7479486 + ... + 7481023.
It is an arithmetic number, because the mean of its divisors is an integer number (2879898175).
Almost surely, 211504631421 is an apocalyptic number.
It is an amenable number.
11504631421 is a deficient number, since it is larger than the sum of its proper divisors (14961279).
11504631421 is an equidigital number, since it uses as much as digits as its factorization.
11504631421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14961278.
The product of its (nonzero) digits is 2880, while the sum is 28.
The spelling of 11504631421 in words is "eleven billion, five hundred four million, six hundred thirty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •