Base | Representation |
---|---|
bin | 10010110101110… |
… | …101100101110001 |
3 | 211000210200211110 |
4 | 102311311211301 |
5 | 1121410244100 |
6 | 51211103533 |
7 | 10555555110 |
oct | 2265654561 |
9 | 730720743 |
10 | 316103025 |
11 | 152482977 |
12 | 89a41ba9 |
13 | 50648514 |
14 | 2dda5c77 |
15 | 1cb40250 |
hex | 12d75971 |
316103025 has 48 divisors (see below), whose sum is σ = 613464704. Its totient is φ = 140590080.
The previous prime is 316103023. The next prime is 316103069. The reversal of 316103025 is 520301613.
It is not a de Polignac number, because 316103025 - 21 = 316103023 is a prime.
It is a super-2 number, since 2×3161030252 = 199842244828301250, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 316102992 and 316103010.
It is not an unprimeable number, because it can be changed into a prime (316103023) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 11289 + ... + 27561.
Almost surely, 2316103025 is an apocalyptic number.
316103025 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
316103025 is a deficient number, since it is larger than the sum of its proper divisors (297361679).
316103025 is a wasteful number, since it uses less digits than its factorization.
316103025 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16330 (or 16325 counting only the distinct ones).
The product of its (nonzero) digits is 540, while the sum is 21.
The square root of 316103025 is about 17779.2864030028. The cubic root of 316103025 is about 681.2024751517.
Adding to 316103025 its reverse (520301613), we get a palindrome (836404638).
The spelling of 316103025 in words is "three hundred sixteen million, one hundred three thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •