Base | Representation |
---|---|
bin | 11001010000100101… |
… | …01111000110110000 |
3 | 1022000002020012110000 |
4 | 30220102233012300 |
5 | 210233042331224 |
6 | 10121345110000 |
7 | 660023523423 |
oct | 145022570660 |
9 | 38002205400 |
10 | 13560902064 |
11 | 5829859486 |
12 | 2765628300 |
13 | 138165b508 |
14 | 9290559ba |
15 | 5457ea0c9 |
hex | 3284af1b0 |
13560902064 has 100 divisors (see below), whose sum is σ = 39414307680. Its totient is φ = 4501284480.
The previous prime is 13560902063. The next prime is 13560902071. The reversal of 13560902064 is 46020906531.
It is a happy number.
13560902064 is a `hidden beast` number, since 1 + 3 + 560 + 90 + 2 + 0 + 6 + 4 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (13560902063) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 287854 + ... + 331634.
Almost surely, 213560902064 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13560902064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19707153840).
13560902064 is an abundant number, since it is smaller than the sum of its proper divisors (25853405616).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13560902064 is a wasteful number, since it uses less digits than its factorization.
13560902064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44040 (or 44025 counting only the distinct ones).
The product of its (nonzero) digits is 38880, while the sum is 36.
The spelling of 13560902064 in words is "thirteen billion, five hundred sixty million, nine hundred two thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •