Base | Representation |
---|---|
bin | 11000001111100101… |
… | …10001000011101101 |
3 | 1020121002020112222011 |
4 | 30013302301003231 |
5 | 203124001304131 |
6 | 5551310321221 |
7 | 640353130015 |
oct | 140762610355 |
9 | 36532215864 |
10 | 13015650541 |
11 | 5579aa4993 |
12 | 2632ab9211 |
13 | 12c56c148a |
14 | 8b6880c45 |
15 | 5129e40b1 |
hex | 307cb10ed |
13015650541 has 8 divisors (see below), whose sum is σ = 13805272800. Its totient is φ = 12236487120.
The previous prime is 13015650539. The next prime is 13015650569. The reversal of 13015650541 is 14505651031.
It is a happy number.
13015650541 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 13015650541 - 21 = 13015650539 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13015650841) 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, 2612146 + ... + 2617123.
It is an arithmetic number, because the mean of its divisors is an integer number (1725659100).
Almost surely, 213015650541 is an apocalyptic number.
It is an amenable number.
13015650541 is a deficient number, since it is larger than the sum of its proper divisors (789622259).
13015650541 is a wasteful number, since it uses less digits than its factorization.
13015650541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5229419.
The product of its (nonzero) digits is 9000, while the sum is 31.
The spelling of 13015650541 in words is "thirteen billion, fifteen million, six hundred fifty thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •