Base | Representation |
---|---|
bin | 10000011100100000100… |
… | …010001011110011011001 |
3 | 11000001001011100122111222 |
4 | 100130200202023303121 |
5 | 122003442242343001 |
6 | 2223100533301425 |
7 | 144435324316001 |
oct | 20344042136331 |
9 | 4001034318458 |
10 | 1130122231001 |
11 | 3a631159aa85 |
12 | 163037794875 |
13 | 827545988ba |
14 | 3c9abc4d001 |
15 | 1e5e51c161b |
hex | 1072088bcd9 |
1130122231001 has 2 divisors, whose sum is σ = 1130122231002. Its totient is φ = 1130122231000.
The previous prime is 1130122230989. The next prime is 1130122231003. The reversal of 1130122231001 is 1001322210311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 990114552025 + 140007678976 = 995045^2 + 374176^2 .
It is a cyclic number.
It is not a de Polignac number, because 1130122231001 - 226 = 1130055122137 is a prime.
Together with 1130122231003, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1130122231003) 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 as a sum of consecutive naturals, namely, 565061115500 + 565061115501.
It is an arithmetic number, because the mean of its divisors is an integer number (565061115501).
Almost surely, 21130122231001 is an apocalyptic number.
It is an amenable number.
1130122231001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1130122231001 is an equidigital number, since it uses as much as digits as its factorization.
1130122231001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 1130122231001 its reverse (1001322210311), we get a palindrome (2131444441312).
The spelling of 1130122231001 in words is "one trillion, one hundred thirty billion, one hundred twenty-two million, two hundred thirty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •