Base | Representation |
---|---|
bin | 101000001000001111000… |
… | …0000000110110100110101 |
3 | 201112020210122121202201210 |
4 | 1100100132000012310311 |
5 | 1210330203241240001 |
6 | 15421400014512033 |
7 | 1106314551665526 |
oct | 120203600066465 |
9 | 21466718552653 |
10 | 5515241352501 |
11 | 1837000a63751 |
12 | 750a83205619 |
13 | 310114a636ca |
14 | 150d20c9884d |
15 | 986e6440dd6 |
hex | 5041e006d35 |
5515241352501 has 8 divisors (see below), whose sum is σ = 7590869818624. Its totient is φ = 3558220227360.
The previous prime is 5515241352493. The next prime is 5515241352527. The reversal of 5515241352501 is 1052531425155.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5515241352501 - 23 = 5515241352493 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5515241352501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5515241352541) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 29651835136 + ... + 29651835321.
It is an arithmetic number, because the mean of its divisors is an integer number (948858727328).
Almost surely, 25515241352501 is an apocalyptic number.
It is an amenable number.
5515241352501 is a deficient number, since it is larger than the sum of its proper divisors (2075628466123).
5515241352501 is a wasteful number, since it uses less digits than its factorization.
5515241352501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 59303670491.
The product of its (nonzero) digits is 150000, while the sum is 39.
Adding to 5515241352501 its reverse (1052531425155), we get a palindrome (6567772777656).
The spelling of 5515241352501 in words is "five trillion, five hundred fifteen billion, two hundred forty-one million, three hundred fifty-two thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •