Base | Representation |
---|---|
bin | 1110101110111010110… |
… | …11110111111111110000 |
3 | 1210101122202222202120000 |
4 | 13113131123313333300 |
5 | 31243222404324431 |
6 | 1024320201150000 |
7 | 51400521043050 |
oct | 7273533677760 |
9 | 1711582882500 |
10 | 506226245616 |
11 | 185764577a33 |
12 | 8213a18b300 |
13 | 3897705cc90 |
14 | 1a7040c7560 |
15 | d27c55b9e6 |
hex | 75dd6f7ff0 |
506226245616 has 800 divisors, whose sum is σ = 1931490126720. Its totient is φ = 124201009152.
The previous prime is 506226245593. The next prime is 506226245617. The reversal of 506226245616 is 616542622605.
506226245616 is a `hidden beast` number, since 5 + 0 + 6 + 2 + 2 + 6 + 24 + 5 + 616 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (506226245617) by changing a digit.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 178435750 + ... + 178438586.
Almost surely, 2506226245616 is an apocalyptic number.
506226245616 is a gapful number since it is divisible by the number (56) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 506226245616, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (965745063360).
506226245616 is an abundant number, since it is smaller than the sum of its proper divisors (1425263881104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
506226245616 is a wasteful number, since it uses less digits than its factorization.
506226245616 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2983 (or 2968 counting only the distinct ones).
The product of its (nonzero) digits is 1036800, while the sum is 45.
The spelling of 506226245616 in words is "five hundred six billion, two hundred twenty-six million, two hundred forty-five thousand, six hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •