Base | Representation |
---|---|
bin | 11001110100010100… |
… | …10101100000000001 |
3 | 1022202222100000001222 |
4 | 30322022111200001 |
5 | 211341314034141 |
6 | 10211214404425 |
7 | 1000323630461 |
oct | 147212254001 |
9 | 38688300058 |
10 | 13860689921 |
11 | 5972aa8541 |
12 | 2829b00715 |
13 | 13cb7b3890 |
14 | 956bb1ba1 |
15 | 561cb614b |
hex | 33a295801 |
13860689921 has 8 divisors (see below), whose sum is σ = 15094616040. Its totient is φ = 12650723712.
The previous prime is 13860689911. The next prime is 13860689929. The reversal of 13860689921 is 12998606831.
It can be written as a sum of positive squares in 4 ways, for example, as 1678049296 + 12182640625 = 40964^2 + 110375^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13860689921 - 214 = 13860673537 is a prime.
It is a super-2 number, since 2×138606899212 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13860689929) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5988770 + ... + 5991083.
It is an arithmetic number, because the mean of its divisors is an integer number (1886827005).
Almost surely, 213860689921 is an apocalyptic number.
It is an amenable number.
13860689921 is a deficient number, since it is larger than the sum of its proper divisors (1233926119).
13860689921 is a wasteful number, since it uses less digits than its factorization.
13860689921 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11979955.
The product of its (nonzero) digits is 1119744, while the sum is 53.
The spelling of 13860689921 in words is "thirteen billion, eight hundred sixty million, six hundred eighty-nine thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •