Base | Representation |
---|---|
bin | 11001101100100111… |
… | …01000010110001101 |
3 | 1022121110122022020221 |
4 | 30312103220112031 |
5 | 211223240030144 |
6 | 10200544311341 |
7 | 665610133336 |
oct | 146623502615 |
9 | 38543568227 |
10 | 13796017549 |
11 | 593a5461a6 |
12 | 2810312551 |
13 | 13bb28bcc2 |
14 | 94c37928d |
15 | 55b28dd84 |
hex | 3364e858d |
13796017549 has 2 divisors, whose sum is σ = 13796017550. Its totient is φ = 13796017548.
The previous prime is 13796017523. The next prime is 13796017567. The reversal of 13796017549 is 94571069731.
13796017549 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10765515049 + 3030502500 = 103757^2 + 55050^2 .
It is a cyclic number.
It is not a de Polignac number, because 13796017549 - 217 = 13795886477 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13796017496 and 13796017505.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13796017519) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6898008774 + 6898008775.
It is an arithmetic number, because the mean of its divisors is an integer number (6898008775).
Almost surely, 213796017549 is an apocalyptic number.
It is an amenable number.
13796017549 is a deficient number, since it is larger than the sum of its proper divisors (1).
13796017549 is an equidigital number, since it uses as much as digits as its factorization.
13796017549 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1428840, while the sum is 52.
The spelling of 13796017549 in words is "thirteen billion, seven hundred ninety-six million, seventeen thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •