Base | Representation |
---|---|
bin | 11101001100101010010… |
… | …11001010000111010001 |
3 | 10112220111211110000121201 |
4 | 32212111023022013101 |
5 | 112414103402011121 |
6 | 2044513314551201 |
7 | 132323656143556 |
oct | 16462513120721 |
9 | 3486454400551 |
10 | 1003230110161 |
11 | 357516274524 |
12 | 142523898501 |
13 | 737b154a526 |
14 | 367b142ca2d |
15 | 1b16a110e91 |
hex | e9952ca1d1 |
1003230110161 has 2 divisors, whose sum is σ = 1003230110162. Its totient is φ = 1003230110160.
The previous prime is 1003230110123. The next prime is 1003230110177. The reversal of 1003230110161 is 1610110323001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 591138011025 + 412092099136 = 768855^2 + 641944^2 .
It is a cyclic number.
It is not a de Polignac number, because 1003230110161 - 219 = 1003229585873 is a prime.
It is not a weakly prime, because it can be changed into another prime (1003230110191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 501615055080 + 501615055081.
It is an arithmetic number, because the mean of its divisors is an integer number (501615055081).
Almost surely, 21003230110161 is an apocalyptic number.
It is an amenable number.
1003230110161 is a deficient number, since it is larger than the sum of its proper divisors (1).
1003230110161 is an equidigital number, since it uses as much as digits as its factorization.
1003230110161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 1003230110161 its reverse (1610110323001), we get a palindrome (2613340433162).
The spelling of 1003230110161 in words is "one trillion, three billion, two hundred thirty million, one hundred ten thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •