Base | Representation |
---|---|
bin | 11000001010001101101101… |
… | …00010111110101000111000 |
3 | 20222002221101201211112100122 |
4 | 30011012312202332220320 |
5 | 23430420121323411000 |
6 | 304554235333152412 |
7 | 14122223205253523 |
oct | 1405066642765070 |
9 | 228087351745318 |
10 | 53127513107000 |
11 | 15a23285132422 |
12 | 5b6057478b708 |
13 | 2384b97b37087 |
14 | d195575abbba |
15 | 621e7dc2a085 |
hex | 3051b68bea38 |
53127513107000 has 96 divisors (see below), whose sum is σ = 125067325378320. Its totient is φ = 21123742625600.
The previous prime is 53127513106949. The next prime is 53127513107017. The reversal of 53127513107000 is 70131572135.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 26936519 + ... + 28841481.
Almost surely, 253127513107000 is an apocalyptic number.
53127513107000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 53127513107000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (62533662689160).
53127513107000 is an abundant number, since it is smaller than the sum of its proper divisors (71939812271320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53127513107000 is a wasteful number, since it uses less digits than its factorization.
53127513107000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1905318 (or 1905137 counting only the distinct ones).
The product of its (nonzero) digits is 22050, while the sum is 35.
Adding to 53127513107000 its reverse (70131572135), we get a palindrome (53197644679135).
The spelling of 53127513107000 in words is "fifty-three trillion, one hundred twenty-seven billion, five hundred thirteen million, one hundred seven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •