Base | Representation |
---|---|
bin | 100001000101001… |
… | …1011101010011001 |
3 | 2212100201102021022 |
4 | 1002022123222121 |
5 | 4233131443001 |
6 | 302051452225 |
7 | 36336051662 |
oct | 10212335231 |
9 | 2770642238 |
10 | 1110031001 |
11 | 51a6467a2 |
12 | 26b8b7075 |
13 | 148c836a1 |
14 | a75d0369 |
15 | 676b811b |
hex | 4229ba99 |
1110031001 has 2 divisors, whose sum is σ = 1110031002. Its totient is φ = 1110031000.
The previous prime is 1110030967. The next prime is 1110031003. The reversal of 1110031001 is 1001300111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1035294976 + 74736025 = 32176^2 + 8645^2 .
It is a cyclic number.
It is not a de Polignac number, because 1110031001 - 26 = 1110030937 is a prime.
It is a Sophie Germain prime.
Together with 1110031003, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1110031001.
It is not a weakly prime, because it can be changed into another prime (1110031003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555015500 + 555015501.
It is an arithmetic number, because the mean of its divisors is an integer number (555015501).
Almost surely, 21110031001 is an apocalyptic number.
It is an amenable number.
1110031001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110031001 is an equidigital number, since it uses as much as digits as its factorization.
1110031001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3, while the sum is 8.
The square root of 1110031001 is about 33317.1277423490. The cubic root of 1110031001 is about 1035.4084445173.
Adding to 1110031001 its reverse (1001300111), we get a palindrome (2111331112).
The spelling of 1110031001 in words is "one billion, one hundred ten million, thirty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •