Base | Representation |
---|---|
bin | 11001010110011000… |
… | …01011100101111110 |
3 | 1022010110201000101120 |
4 | 30223030023211332 |
5 | 210333013443030 |
6 | 10130243051410 |
7 | 661153654302 |
oct | 145314134576 |
9 | 38113630346 |
10 | 13609515390 |
11 | 5854242389 |
12 | 2779970b66 |
13 | 138b74c6b3 |
14 | 9316abd02 |
15 | 549bee010 |
hex | 32b30b97e |
13609515390 has 16 divisors (see below), whose sum is σ = 32662837008. Its totient is φ = 3629204096.
The previous prime is 13609515389. The next prime is 13609515419. The reversal of 13609515390 is 9351590631.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 226825227 + ... + 226825286.
It is an arithmetic number, because the mean of its divisors is an integer number (2041427313).
Almost surely, 213609515390 is an apocalyptic number.
13609515390 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13609515390 is an abundant number, since it is smaller than the sum of its proper divisors (19053321618).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13609515390 is a wasteful number, since it uses less digits than its factorization.
13609515390 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 453650523.
The product of its (nonzero) digits is 109350, while the sum is 42.
The spelling of 13609515390 in words is "thirteen billion, six hundred nine million, five hundred fifteen thousand, three hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •