Base | Representation |
---|---|
bin | 100100111011111101101… |
… | …0011111001011010000010 |
3 | 122222022112002002222112210 |
4 | 1021313323103321122002 |
5 | 1131133310101024131 |
6 | 14444051214402550 |
7 | 1032525126514524 |
oct | 111677323713202 |
9 | 18868462088483 |
10 | 5076572673666 |
11 | 1687a64a2363a |
12 | 69ba59b00456 |
13 | 2aa946126220 |
14 | 1379c927da14 |
15 | 8c0bed8b146 |
hex | 49dfb4f9682 |
5076572673666 has 64 divisors (see below), whose sum is σ = 11126637849600. Its totient is φ = 1534648078656.
The previous prime is 5076572673649. The next prime is 5076572673671. The reversal of 5076572673666 is 6663762756705.
It is a super-2 number, since 2×50765726736662 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5076572673597 and 5076572673606.
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, 699115 + ... + 3262193.
It is an arithmetic number, because the mean of its divisors is an integer number (173853716400).
Almost surely, 25076572673666 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5076572673666, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5563318924800).
5076572673666 is an abundant number, since it is smaller than the sum of its proper divisors (6050065175934).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5076572673666 is a wasteful number, since it uses less digits than its factorization.
5076572673666 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2563543.
The product of its (nonzero) digits is 400075200, while the sum is 66.
The spelling of 5076572673666 in words is "five trillion, seventy-six billion, five hundred seventy-two million, six hundred seventy-three thousand, six hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •