Base | Representation |
---|---|
bin | 1001100000000101… |
… | …11111000000111100 |
3 | 111011111112111102020 |
4 | 10300002333000330 |
5 | 40421332243220 |
6 | 2202101200140 |
7 | 240260155362 |
oct | 46002770074 |
9 | 14144474366 |
10 | 5101056060 |
11 | 218845aa11 |
12 | ba4400050 |
13 | 633a81c89 |
14 | 365689632 |
15 | 1ecc69040 |
hex | 1300bf03c |
5101056060 has 96 divisors (see below), whose sum is σ = 14876047872. Its totient is φ = 1304835840.
The previous prime is 5101056017. The next prime is 5101056089. The reversal of 5101056060 is 606501015.
It is a self number, because there is not a number n which added to its sum of digits gives 5101056060.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 141439 + ... + 173801.
It is an arithmetic number, because the mean of its divisors is an integer number (154958832).
Almost surely, 25101056060 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 5101056060, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7438023936).
5101056060 is an abundant number, since it is smaller than the sum of its proper divisors (9774991812).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5101056060 is a wasteful number, since it uses less digits than its factorization.
5101056060 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32483 (or 32481 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 24.
The square root of 5101056060 is about 71421.6778016311. The cubic root of 5101056060 is about 1721.4194227706.
Adding to 5101056060 its reverse (606501015), we get a palindrome (5707557075).
The spelling of 5101056060 in words is "five billion, one hundred one million, fifty-six thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •