Base | Representation |
---|---|
bin | 11001011011111110… |
… | …10010000010001111 |
3 | 1022020202001022220102 |
4 | 30231333102002033 |
5 | 210432023344201 |
6 | 10135041241315 |
7 | 662264020241 |
oct | 145577220217 |
9 | 38222038812 |
10 | 13656465551 |
11 | 587879a773 |
12 | 279163323b |
13 | 13983aa861 |
14 | 937a10091 |
15 | 54ddc526b |
hex | 32dfd208f |
13656465551 has 4 divisors (see below), whose sum is σ = 14459787072. Its totient is φ = 12853144032.
The previous prime is 13656465541. The next prime is 13656465569. The reversal of 13656465551 is 15556465631.
It is a semiprime because it is the product of two primes.
It is a de Polignac number, because none of the positive numbers 2k-13656465551 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13656465496 and 13656465505.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13656465521) 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 3 ways as a sum of consecutive naturals, for example, 401660735 + ... + 401660768.
It is an arithmetic number, because the mean of its divisors is an integer number (3614946768).
Almost surely, 213656465551 is an apocalyptic number.
13656465551 is a deficient number, since it is larger than the sum of its proper divisors (803321521).
13656465551 is an equidigital number, since it uses as much as digits as its factorization.
13656465551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 803321520.
The product of its digits is 1620000, while the sum is 47.
The spelling of 13656465551 in words is "thirteen billion, six hundred fifty-six million, four hundred sixty-five thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •