Base | Representation |
---|---|
bin | 1010000111010110100010… |
… | …0001110001110001000011 |
3 | 1110101012100011100201100001 |
4 | 2201311220201301301003 |
5 | 2424203134021430103 |
6 | 35353040041340431 |
7 | 2225332153240243 |
oct | 241655041616103 |
9 | 43335304321301 |
10 | 11121424014403 |
11 | 35a8629a1513a |
12 | 12b74a6497717 |
13 | 6289906475a1 |
14 | 2a63cba81b23 |
15 | 14446169a01d |
hex | a1d68871c43 |
11121424014403 has 8 divisors (see below), whose sum is σ = 11721995384400. Its totient is φ = 10535324243808.
The previous prime is 11121424014329. The next prime is 11121424014413. The reversal of 11121424014403 is 30441042412111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11121424014403 - 233 = 11112834079811 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11121424014413) 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, 3617898273 + ... + 3617901346.
It is an arithmetic number, because the mean of its divisors is an integer number (1465249423050).
Almost surely, 211121424014403 is an apocalyptic number.
11121424014403 is a deficient number, since it is larger than the sum of its proper divisors (600571369997).
11121424014403 is an equidigital number, since it uses as much as digits as its factorization.
11121424014403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7235799701.
The product of its (nonzero) digits is 3072, while the sum is 28.
Adding to 11121424014403 its reverse (30441042412111), we get a palindrome (41562466426514).
The spelling of 11121424014403 in words is "eleven trillion, one hundred twenty-one billion, four hundred twenty-four million, fourteen thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.175 sec. • engine limits •