Base | Representation |
---|---|
bin | 11001111010100001… |
… | …00000000000110011 |
3 | 1022220121002012202001 |
4 | 30331100200000303 |
5 | 211443113344431 |
6 | 10220312034431 |
7 | 1001524316224 |
oct | 147520400063 |
9 | 38817065661 |
10 | 13912637491 |
11 | 599a359515 |
12 | 2843392a17 |
13 | 14094a159c |
14 | 95da5524b |
15 | 566627e61 |
hex | 33d420033 |
13912637491 has 2 divisors, whose sum is σ = 13912637492. Its totient is φ = 13912637490.
The previous prime is 13912637483. The next prime is 13912637513. The reversal of 13912637491 is 19473621931.
It is a weak prime.
It is an emirp because it is prime and its reverse (19473621931) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13912637491 - 23 = 13912637483 is a prime.
It is a super-2 number, since 2×139126374912 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13912632491) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6956318745 + 6956318746.
It is an arithmetic number, because the mean of its divisors is an integer number (6956318746).
Almost surely, 213912637491 is an apocalyptic number.
13912637491 is a deficient number, since it is larger than the sum of its proper divisors (1).
13912637491 is an equidigital number, since it uses as much as digits as its factorization.
13912637491 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 244944, while the sum is 46.
The spelling of 13912637491 in words is "thirteen billion, nine hundred twelve million, six hundred thirty-seven thousand, four hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •