Base | Representation |
---|---|
bin | 11101001100100110110… |
… | …01100001001011001001 |
3 | 10112220102202101112110212 |
4 | 32212103121201023021 |
5 | 112414023240221301 |
6 | 2044510332250505 |
7 | 132323145011432 |
oct | 16462331411311 |
9 | 3486382345425 |
10 | 1003200320201 |
11 | 357500477922 |
12 | 142515910a35 |
13 | 737a831a031 |
14 | 367ab4b6489 |
15 | 1b1676c94bb |
hex | e9936612c9 |
1003200320201 has 2 divisors, whose sum is σ = 1003200320202. Its totient is φ = 1003200320200.
The previous prime is 1003200320117. The next prime is 1003200320203. The reversal of 1003200320201 is 1020230023001.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 946223107600 + 56977212601 = 972740^2 + 238699^2 .
It is a cyclic number.
It is not a de Polignac number, because 1003200320201 - 238 = 728322413257 is a prime.
Together with 1003200320203, 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 (1003200320203) 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, 501600160100 + 501600160101.
It is an arithmetic number, because the mean of its divisors is an integer number (501600160101).
Almost surely, 21003200320201 is an apocalyptic number.
It is an amenable number.
1003200320201 is a deficient number, since it is larger than the sum of its proper divisors (1).
1003200320201 is an equidigital number, since it uses as much as digits as its factorization.
1003200320201 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 14.
Adding to 1003200320201 its reverse (1020230023001), we get a palindrome (2023430343202).
The spelling of 1003200320201 in words is "one trillion, three billion, two hundred million, three hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •