Base | Representation |
---|---|
bin | 11000011111110010… |
… | …01111010100001000 |
3 | 1020221112222201122101 |
4 | 30033321033110020 |
5 | 203413300040224 |
6 | 10013003403144 |
7 | 643623313201 |
oct | 141771172410 |
9 | 36845881571 |
10 | 13151565064 |
11 | 5639796540 |
12 | 26705234b4 |
13 | 13178cb081 |
14 | 8ca9405a8 |
15 | 51e8e0044 |
hex | 30fe4f508 |
13151565064 has 32 divisors (see below), whose sum is σ = 27094485600. Its totient is φ = 5934971520.
The previous prime is 13151565059. The next prime is 13151565131. The reversal of 13151565064 is 46056515131.
13151565064 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
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, 525357 + ... + 549820.
It is an arithmetic number, because the mean of its divisors is an integer number (846702675).
Almost surely, 213151565064 is an apocalyptic number.
It is an amenable number.
13151565064 is an abundant number, since it is smaller than the sum of its proper divisors (13942920536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13151565064 is a wasteful number, since it uses less digits than its factorization.
13151565064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1075333 (or 1075329 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 37.
The spelling of 13151565064 in words is "thirteen billion, one hundred fifty-one million, five hundred sixty-five thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •