Base | Representation |
---|---|
bin | 11110101111101011… |
… | …10111101011010010 |
3 | 1120121100012000210100 |
4 | 33113311313223102 |
5 | 232301032000020 |
6 | 11325515313230 |
7 | 1123015514304 |
oct | 172765675322 |
9 | 46540160710 |
10 | 16506125010 |
11 | 7000306031 |
12 | 3247a4b816 |
13 | 17308a419b |
14 | b2827d974 |
15 | 66916da90 |
hex | 3d7d77ad2 |
16506125010 has 48 divisors (see below), whose sum is σ = 45440395416. Its totient is φ = 4142713344.
The previous prime is 16506124981. The next prime is 16506125011. The reversal of 16506125010 is 1052160561.
It is a happy number.
16506125010 is a `hidden beast` number, since 1 + 650 + 6 + 1 + 2 + 5 + 0 + 1 + 0 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 15991878681 + 514246329 = 126459^2 + 22677^2 .
It is not an unprimeable number, because it can be changed into a prime (16506125011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5392629 + ... + 5395688.
Almost surely, 216506125010 is an apocalyptic number.
16506125010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
16506125010 is an abundant number, since it is smaller than the sum of its proper divisors (28934270406).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16506125010 is a wasteful number, since it uses less digits than its factorization.
16506125010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10788347 (or 10788344 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 27.
Adding to 16506125010 its reverse (1052160561), we get a palindrome (17558285571).
The spelling of 16506125010 in words is "sixteen billion, five hundred six million, one hundred twenty-five thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •