Base | Representation |
---|---|
bin | 111100100100111… |
… | …100010000000011 |
3 | 2121211101020201211 |
4 | 330210330100003 |
5 | 4040134120211 |
6 | 244503110551 |
7 | 34120360060 |
oct | 7444742003 |
9 | 2554336654 |
10 | 1016316931 |
11 | 481758a53 |
12 | 244442457 |
13 | 132731086 |
14 | 98d97c67 |
15 | 5e355e21 |
hex | 3c93c403 |
1016316931 has 8 divisors (see below), whose sum is σ = 1169301600. Its totient is φ = 865281408.
The previous prime is 1016316929. The next prime is 1016316941. The reversal of 1016316931 is 1396136101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1016316931 - 21 = 1016316929 is a prime.
It is a super-2 number, since 2×10163169312 = 2065800208474517522, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1016316893 and 1016316902.
It is not an unprimeable number, because it can be changed into a prime (1016316941) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 486166 + ... + 488251.
It is an arithmetic number, because the mean of its divisors is an integer number (146162700).
Almost surely, 21016316931 is an apocalyptic number.
1016316931 is a deficient number, since it is larger than the sum of its proper divisors (152984669).
1016316931 is an equidigital number, since it uses as much as digits as its factorization.
1016316931 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 974573.
The product of its (nonzero) digits is 2916, while the sum is 31.
The square root of 1016316931 is about 31879.7260182706. The cubic root of 1016316931 is about 1005.4096598105.
The spelling of 1016316931 in words is "one billion, sixteen million, three hundred sixteen thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •