Base | Representation |
---|---|
bin | 100100110100100011011… |
… | …0100011010111100110000 |
3 | 122220210110001220012000000 |
4 | 1021221012310122330300 |
5 | 1130403212330343210 |
6 | 14432500202430000 |
7 | 1031422602016125 |
oct | 111510664327460 |
9 | 18823401805000 |
10 | 5060659621680 |
11 | 1681239475103 |
12 | 698958802300 |
13 | 2a92ab393a30 |
14 | 136d19aa274c |
15 | 8b98cd1cac0 |
hex | 49a46d1af30 |
5060659621680 has 1120 divisors, whose sum is σ = 19744054549632. Its totient is φ = 1197678182400.
The previous prime is 5060659621651. The next prime is 5060659621691. The reversal of 5060659621680 is 861269560605.
5060659621680 is a `hidden beast` number, since 5 + 0 + 6 + 0 + 6 + 5 + 9 + 621 + 6 + 8 + 0 = 666.
It is a super-2 number, since 2×50606596216802 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is an unprimeable number.
It is a polite number, since it can be written in 223 ways as a sum of consecutive naturals, for example, 2207002614 + ... + 2207004906.
Almost surely, 25060659621680 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 5060659621680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9872027274816).
5060659621680 is an abundant number, since it is smaller than the sum of its proper divisors (14683394927952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5060659621680 is a wasteful number, since it uses less digits than its factorization.
5060659621680 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2449 (or 2428 counting only the distinct ones).
The product of its (nonzero) digits is 4665600, while the sum is 54.
The spelling of 5060659621680 in words is "five trillion, sixty billion, six hundred fifty-nine million, six hundred twenty-one thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •