Base | Representation |
---|---|
bin | 11001000011011100… |
… | …00110011111010001 |
3 | 1021201101202001202201 |
4 | 30201232012133101 |
5 | 210021330311332 |
6 | 10102405443201 |
7 | 654214340635 |
oct | 144156063721 |
9 | 37641661681 |
10 | 13450635217 |
11 | 5782595358 |
12 | 2734710501 |
13 | 1364861866 |
14 | 918550dc5 |
15 | 53acb85e7 |
hex | 321b867d1 |
13450635217 has 4 divisors (see below), whose sum is σ = 13454804020. Its totient is φ = 13446466416.
The previous prime is 13450635113. The next prime is 13450635223. The reversal of 13450635217 is 71253605431.
13450635217 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1339852816 + 12110782401 = 36604^2 + 110049^2 .
It is a cyclic number.
It is not a de Polignac number, because 13450635217 - 27 = 13450635089 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13450635017) 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 in 3 ways as a sum of consecutive naturals, for example, 2079558 + ... + 2086015.
It is an arithmetic number, because the mean of its divisors is an integer number (3363701005).
Almost surely, 213450635217 is an apocalyptic number.
It is an amenable number.
13450635217 is a deficient number, since it is larger than the sum of its proper divisors (4168803).
13450635217 is an equidigital number, since it uses as much as digits as its factorization.
13450635217 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4168802.
The product of its (nonzero) digits is 75600, while the sum is 37.
The spelling of 13450635217 in words is "thirteen billion, four hundred fifty million, six hundred thirty-five thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •