Base | Representation |
---|---|
bin | 11001011010101001… |
… | …00000111111100111 |
3 | 1022012221221202102011 |
4 | 30231110200333213 |
5 | 210421141122011 |
6 | 10134001055051 |
7 | 662066515321 |
oct | 145524407747 |
9 | 38187852364 |
10 | 13645254631 |
11 | 5872432848 |
12 | 2789927487 |
13 | 1395c83a88 |
14 | 936332611 |
15 | 54ce0d621 |
hex | 32d520fe7 |
13645254631 has 4 divisors (see below), whose sum is σ = 13780356264. Its totient is φ = 13510153000.
The previous prime is 13645254611. The next prime is 13645254661.
13645254631 is nontrivially palindromic in base 10.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13645254631 is a prime.
It is a super-2 number, since 2×136452546312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13645254611) 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, 67550665 + ... + 67550866.
It is an arithmetic number, because the mean of its divisors is an integer number (3445089066).
Almost surely, 213645254631 is an apocalyptic number.
13645254631 is a deficient number, since it is larger than the sum of its proper divisors (135101633).
13645254631 is a wasteful number, since it uses less digits than its factorization.
13645254631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135101632.
The product of its digits is 259200, while the sum is 40.
The spelling of 13645254631 in words is "thirteen billion, six hundred forty-five million, two hundred fifty-four thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •