Base | Representation |
---|---|
bin | 11001001000001110… |
… | …11011000011110101 |
3 | 1021211012101001020010 |
4 | 30210013123003311 |
5 | 210112122440014 |
6 | 10110403130433 |
7 | 655213066425 |
oct | 144407330365 |
9 | 37735331203 |
10 | 13490827509 |
11 | 57a3247425 |
12 | 2746073a19 |
13 | 136cc94a93 |
14 | 91da14485 |
15 | 53e5a7359 |
hex | 3241db0f5 |
13490827509 has 8 divisors (see below), whose sum is σ = 17989387200. Its totient is φ = 8993076416.
The previous prime is 13490827453. The next prime is 13490827517. The reversal of 13490827509 is 90572809431.
13490827509 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 13490827509 - 27 = 13490827381 is a prime.
It is a super-2 number, since 2×134908275092 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13490827549) 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 7 ways as a sum of consecutive naturals, for example, 162084 + ... + 230765.
It is an arithmetic number, because the mean of its divisors is an integer number (2248673400).
Almost surely, 213490827509 is an apocalyptic number.
It is an amenable number.
13490827509 is a deficient number, since it is larger than the sum of its proper divisors (4498559691).
13490827509 is a wasteful number, since it uses less digits than its factorization.
13490827509 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 404299.
The product of its (nonzero) digits is 544320, while the sum is 48.
The spelling of 13490827509 in words is "thirteen billion, four hundred ninety million, eight hundred twenty-seven thousand, five hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •