Base | Representation |
---|---|
bin | 111100100100111… |
… | …011011010001001 |
3 | 2121211101002000001 |
4 | 330210323122021 |
5 | 4040134012411 |
6 | 244503043001 |
7 | 34120344031 |
oct | 7444733211 |
9 | 2554332001 |
10 | 1016313481 |
11 | 4817563a7 |
12 | 244440461 |
13 | 13272c631 |
14 | 98d968c1 |
15 | 5e354dc1 |
hex | 3c93b689 |
1016313481 has 2 divisors, whose sum is σ = 1016313482. Its totient is φ = 1016313480.
The previous prime is 1016313469. The next prime is 1016313509. The reversal of 1016313481 is 1843136101.
It is an a-pointer prime, because the next prime (1016313509) can be obtained adding 1016313481 to its sum of digits (28).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 678342025 + 337971456 = 26045^2 + 18384^2 .
It is a cyclic number.
It is not a de Polignac number, because 1016313481 - 25 = 1016313449 is a prime.
It is a super-2 number, since 2×10163134812 = 2065786183324674722, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1016311481) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 508156740 + 508156741.
It is an arithmetic number, because the mean of its divisors is an integer number (508156741).
Almost surely, 21016313481 is an apocalyptic number.
It is an amenable number.
1016313481 is a deficient number, since it is larger than the sum of its proper divisors (1).
1016313481 is an equidigital number, since it uses as much as digits as its factorization.
1016313481 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 28.
The square root of 1016313481 is about 31879.6719086003. The cubic root of 1016313481 is about 1005.4085221512.
Adding to 1016313481 its reverse (1843136101), we get a palindrome (2859449582).
The spelling of 1016313481 in words is "one billion, sixteen million, three hundred thirteen thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •