Base | Representation |
---|---|
bin | 1010000001000110011101… |
… | …1011100001000011101111 |
3 | 1102222221010210020100002102 |
4 | 2200101213123201003233 |
5 | 2420423214020212422 |
6 | 35231435353245315 |
7 | 2214510652215344 |
oct | 240214733410357 |
9 | 42887123210072 |
10 | 11014031413487 |
11 | 356702a663603 |
12 | 129a714a0383b |
13 | 61b8073b139b |
14 | 2a1120ca87cb |
15 | 141778445192 |
hex | a04676e10ef |
11014031413487 has 2 divisors, whose sum is σ = 11014031413488. Its totient is φ = 11014031413486.
The previous prime is 11014031413409. The next prime is 11014031413537. The reversal of 11014031413487 is 78431413041011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11014031413487 - 212 = 11014031409391 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11014031413487.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11014091413487) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5507015706743 + 5507015706744.
It is an arithmetic number, because the mean of its divisors is an integer number (5507015706744).
Almost surely, 211014031413487 is an apocalyptic number.
11014031413487 is a deficient number, since it is larger than the sum of its proper divisors (1).
11014031413487 is an equidigital number, since it uses as much as digits as its factorization.
11014031413487 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32256, while the sum is 38.
Adding to 11014031413487 its reverse (78431413041011), we get a palindrome (89445444454498).
The spelling of 11014031413487 in words is "eleven trillion, fourteen billion, thirty-one million, four hundred thirteen thousand, four hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •