Base | Representation |
---|---|
bin | 11010001001010010… |
… | …01111001001101011 |
3 | 1100020020021020221122 |
4 | 31010221033021223 |
5 | 212221330000124 |
6 | 10240500125455 |
7 | 1004560545566 |
oct | 150451171153 |
9 | 40206236848 |
10 | 14036562539 |
11 | 5a5330120a |
12 | 287899688b |
13 | 1429070c0c |
14 | 9722b34dd |
15 | 57245675e |
hex | 344a4f26b |
14036562539 has 2 divisors, whose sum is σ = 14036562540. Its totient is φ = 14036562538.
The previous prime is 14036562517. The next prime is 14036562581. The reversal of 14036562539 is 93526563041.
14036562539 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is an emirp because it is prime and its reverse (93526563041) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14036562539 - 212 = 14036558443 is a prime.
It is a super-2 number, since 2×140365625392 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 14036562539.
It is not a weakly prime, because it can be changed into another prime (14036562139) 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, 7018281269 + 7018281270.
It is an arithmetic number, because the mean of its divisors is an integer number (7018281270).
Almost surely, 214036562539 is an apocalyptic number.
14036562539 is a deficient number, since it is larger than the sum of its proper divisors (1).
14036562539 is an equidigital number, since it uses as much as digits as its factorization.
14036562539 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 583200, while the sum is 44.
The spelling of 14036562539 in words is "fourteen billion, thirty-six million, five hundred sixty-two thousand, five hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •