Base | Representation |
---|---|
bin | 11110011001000001… |
… | …10000011011101110 |
3 | 1120010002111202110200 |
4 | 33030200300123232 |
5 | 231403401302232 |
6 | 11255005214330 |
7 | 1115220026325 |
oct | 171440603356 |
9 | 46102452420 |
10 | 16316040942 |
11 | 6a12a86063 |
12 | 31b42613a6 |
13 | 17003ac3c6 |
14 | b0ad1d0bc |
15 | 65762277c |
hex | 3cc8306ee |
16316040942 has 24 divisors (see below), whose sum is σ = 35368721544. Its totient is φ = 5436018864.
The previous prime is 16316040913. The next prime is 16316040947. The reversal of 16316040942 is 24904061361.
16316040942 is a `hidden beast` number, since 1 + 6 + 3 + 1 + 604 + 0 + 9 + 42 = 666.
16316040942 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 16316040897 and 16316040906.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16316040947) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 183808 + ... + 257715.
It is an arithmetic number, because the mean of its divisors is an integer number (1473696731).
Almost surely, 216316040942 is an apocalyptic number.
16316040942 is an abundant number, since it is smaller than the sum of its proper divisors (19052680602).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16316040942 is a wasteful number, since it uses less digits than its factorization.
16316040942 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 443584 (or 443581 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 36.
The spelling of 16316040942 in words is "sixteen billion, three hundred sixteen million, forty thousand, nine hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •