Base | Representation |
---|---|
bin | 11001001000001110… |
… | …11011000011110110 |
3 | 1021211012101001020011 |
4 | 30210013123003312 |
5 | 210112122440020 |
6 | 10110403130434 |
7 | 655213066426 |
oct | 144407330366 |
9 | 37735331204 |
10 | 13490827510 |
11 | 57a3247426 |
12 | 2746073a1a |
13 | 136cc94a94 |
14 | 91da14486 |
15 | 53e5a735a |
hex | 3241db0f6 |
13490827510 has 16 divisors (see below), whose sum is σ = 24299587872. Its totient is φ = 5392753600.
The previous prime is 13490827453. The next prime is 13490827517. The reversal of 13490827510 is 1572809431.
13490827510 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13490827517) 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, 431311 + ... + 461530.
It is an arithmetic number, because the mean of its divisors is an integer number (1518724242).
Almost surely, 213490827510 is an apocalyptic number.
13490827510 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13490827510 is a deficient number, since it is larger than the sum of its proper divisors (10808760362).
13490827510 is a wasteful number, since it uses less digits than its factorization.
13490827510 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 894359.
The product of its (nonzero) digits is 60480, while the sum is 40.
The spelling of 13490827510 in words is "thirteen billion, four hundred ninety million, eight hundred twenty-seven thousand, five hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •