Base | Representation |
---|---|
bin | 11110000001010011… |
… | …00000000111101000 |
3 | 1112121012222202222200 |
4 | 33000221200013220 |
5 | 231001423204244 |
6 | 11223135220200 |
7 | 1110252204042 |
oct | 170051400750 |
9 | 45535882880 |
10 | 16117006824 |
11 | 69206a2856 |
12 | 3159677660 |
13 | 169b0a2939 |
14 | acc70ca92 |
15 | 644e09669 |
hex | 3c0a601e8 |
16117006824 has 96 divisors (see below), whose sum is σ = 45578052000. Its totient is φ = 5138534016.
The previous prime is 16117006781. The next prime is 16117006877. The reversal of 16117006824 is 42860071161.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 187347 + ... + 259485.
It is an arithmetic number, because the mean of its divisors is an integer number (474771375).
Almost surely, 216117006824 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 16117006824, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22789026000).
16117006824 is an abundant number, since it is smaller than the sum of its proper divisors (29461045176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16117006824 is a wasteful number, since it uses less digits than its factorization.
16117006824 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72287 (or 72280 counting only the distinct ones).
The product of its (nonzero) digits is 16128, while the sum is 36.
Adding to 16117006824 its reverse (42860071161), we get a palindrome (58977077985).
The spelling of 16117006824 in words is "sixteen billion, one hundred seventeen million, six thousand, eight hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •