Base | Representation |
---|---|
bin | 1110101101100101100… |
… | …00000000000000000000 |
3 | 1210022210212102211211001 |
4 | 13112302300000000000 |
5 | 31240241041212432 |
6 | 1024121135501344 |
7 | 51344003650621 |
oct | 7266260000000 |
9 | 1708725384731 |
10 | 505510100992 |
11 | 185427300976 |
12 | 81b7a387854 |
13 | 3889188a270 |
14 | 1a676d49a48 |
15 | d23974a9e7 |
hex | 75b2c00000 |
505510100992 has 184 divisors, whose sum is σ = 1112396397056. Its totient is φ = 228304355328.
The previous prime is 505510100987. The next prime is 505510100993. The reversal of 505510100992 is 299001015505.
It is not an unprimeable number, because it can be changed into a prime (505510100993) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3980394433 + ... + 3980394559.
Almost surely, 2505510100992 is an apocalyptic number.
505510100992 is a gapful number since it is divisible by the number (52) 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 505510100992, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (556198198528).
505510100992 is an abundant number, since it is smaller than the sum of its proper divisors (606886296064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
505510100992 is an frugal number, since it uses more digits than its factorization.
505510100992 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 257 (or 215 counting only the distinct ones).
The product of its (nonzero) digits is 20250, while the sum is 37.
The spelling of 505510100992 in words is "five hundred five billion, five hundred ten million, one hundred thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •