Base | Representation |
---|---|
bin | 100100110010111110001… |
… | …0010101010111101100100 |
3 | 122220110200021020210000010 |
4 | 1021211330102222331210 |
5 | 1130324233003323430 |
6 | 14431135103050220 |
7 | 1031242442555505 |
oct | 111457422527544 |
9 | 18813607223003 |
10 | 5057261776740 |
11 | 167a855480998 |
12 | 69816a8a0970 |
13 | 2a8b89443ab4 |
14 | 136ab66d6bac |
15 | 8b83e88dcb0 |
hex | 4997c4aaf64 |
5057261776740 has 192 divisors, whose sum is σ = 15103125273600. Its totient is φ = 1260731091456.
The previous prime is 5057261776729. The next prime is 5057261776747. The reversal of 5057261776740 is 476771627505.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is not an unprimeable number, because it can be changed into a prime (5057261776747) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 80679531 + ... + 80742189.
It is an arithmetic number, because the mean of its divisors is an integer number (78662110800).
Almost surely, 25057261776740 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 5057261776740, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7551562636800).
5057261776740 is an abundant number, since it is smaller than the sum of its proper divisors (10045863496860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5057261776740 is a wasteful number, since it uses less digits than its factorization.
5057261776740 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 63626 (or 63624 counting only the distinct ones).
The product of its (nonzero) digits is 17287200, while the sum is 57.
The spelling of 5057261776740 in words is "five trillion, fifty-seven billion, two hundred sixty-one million, seven hundred seventy-six thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •