Base | Representation |
---|---|
bin | 11001100001011110… |
… | …00110111000100001 |
3 | 1022100221210000210011 |
4 | 30300233012320201 |
5 | 211030323312332 |
6 | 10143405204521 |
7 | 663363546256 |
oct | 146057067041 |
9 | 38327700704 |
10 | 13702557217 |
11 | 58a1811058 |
12 | 27a4b60741 |
13 | 13a4ac802b |
14 | 93dbab42d |
15 | 552e7be47 |
hex | 330bc6e21 |
13702557217 has 4 divisors (see below), whose sum is σ = 14175059220. Its totient is φ = 13230055216.
The previous prime is 13702557191. The next prime is 13702557223. The reversal of 13702557217 is 71275520731.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 71275520731 = 10259 ⋅6947609.
It can be written as a sum of positive squares in 2 ways, for example, as 6482826256 + 7219730961 = 80516^2 + 84969^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13702557217 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13702557217.
It is not an unprimeable number, because it can be changed into a prime (13702567217) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 236250958 + ... + 236251015.
It is an arithmetic number, because the mean of its divisors is an integer number (3543764805).
Almost surely, 213702557217 is an apocalyptic number.
It is an amenable number.
13702557217 is a deficient number, since it is larger than the sum of its proper divisors (472502003).
13702557217 is an equidigital number, since it uses as much as digits as its factorization.
13702557217 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 472502002.
The product of its (nonzero) digits is 102900, while the sum is 40.
The spelling of 13702557217 in words is "thirteen billion, seven hundred two million, five hundred fifty-seven thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •