Base | Representation |
---|---|
bin | 100100110111010001100… |
… | …0000000000100110000110 |
3 | 122221100112011201120211100 |
4 | 1021232203000000212012 |
5 | 1131002143242140010 |
6 | 14435303554320530 |
7 | 1032020423021352 |
oct | 111564300004606 |
9 | 18840464646740 |
10 | 5066501130630 |
11 | 1683766894255 |
12 | 699b08b89146 |
13 | 2a99cc679ac4 |
14 | 137311816462 |
15 | 8bbd0a9a2c0 |
hex | 49ba3000986 |
5066501130630 has 192 divisors, whose sum is σ = 13707062673408. Its totient is φ = 1297351883520.
The previous prime is 5066501130611. The next prime is 5066501130637. The reversal of 5066501130630 is 360311056605.
5066501130630 is a `hidden beast` number, since 5 + 0 + 6 + 6 + 5 + 0 + 1 + 13 + 0 + 630 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5066501130637) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 80744449 + ... + 80807171.
It is an arithmetic number, because the mean of its divisors is an integer number (71390951424).
Almost surely, 25066501130630 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5066501130630, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6853531336704).
5066501130630 is an abundant number, since it is smaller than the sum of its proper divisors (8640561542778).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5066501130630 is a wasteful number, since it uses less digits than its factorization.
5066501130630 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63091 (or 63088 counting only the distinct ones).
The product of its (nonzero) digits is 48600, while the sum is 36.
The spelling of 5066501130630 in words is "five trillion, sixty-six billion, five hundred one million, one hundred thirty thousand, six hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •