Base | Representation |
---|---|
bin | 11001110100010011… |
… | …10011011111010001 |
3 | 1022202222001220222021 |
4 | 30322021303133101 |
5 | 211341300104414 |
6 | 10211211411441 |
7 | 1000322510353 |
oct | 147211633721 |
9 | 38688056867 |
10 | 13860550609 |
11 | 5972a12904 |
12 | 2829a53b81 |
13 | 13cb765349 |
14 | 956b770d3 |
15 | 561c89c24 |
hex | 33a2737d1 |
13860550609 has 4 divisors (see below), whose sum is σ = 14338500660. Its totient is φ = 13382600560.
The previous prime is 13860550591. The next prime is 13860550621. The reversal of 13860550609 is 90605506831.
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 8340803584 + 5519747025 = 91328^2 + 74295^2 .
It is a cyclic number.
It is not a de Polignac number, because 13860550609 - 29 = 13860550097 is a prime.
It is a super-2 number, since 2×138605506092 (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 (13860550909) 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, 238974982 + ... + 238975039.
It is an arithmetic number, because the mean of its divisors is an integer number (3584625165).
Almost surely, 213860550609 is an apocalyptic number.
It is an amenable number.
13860550609 is a deficient number, since it is larger than the sum of its proper divisors (477950051).
13860550609 is an equidigital number, since it uses as much as digits as its factorization.
13860550609 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 477950050.
The product of its (nonzero) digits is 194400, while the sum is 43.
The spelling of 13860550609 in words is "thirteen billion, eight hundred sixty million, five hundred fifty thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •