Base | Representation |
---|---|
bin | 10001100000110000010… |
… | …010111001001010110011 |
3 | 11021001012002110222211022 |
4 | 101200300102321022303 |
5 | 124204031140231003 |
6 | 2320500154010055 |
7 | 152641254410222 |
oct | 21406022711263 |
9 | 4231162428738 |
10 | 1203401102003 |
11 | 4243a56053a1 |
12 | 17528871692b |
13 | 896321082b9 |
14 | 42360100cb9 |
15 | 214835ae738 |
hex | 118304b92b3 |
1203401102003 has 2 divisors, whose sum is σ = 1203401102004. Its totient is φ = 1203401102002.
The previous prime is 1203401101993. The next prime is 1203401102009. The reversal of 1203401102003 is 3002011043021.
It is a strong prime.
It is an emirp because it is prime and its reverse (3002011043021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1203401102003 - 214 = 1203401085619 is a prime.
It is a super-2 number, since 2×12034011020032 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (1203401102009) 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, 601700551001 + 601700551002.
It is an arithmetic number, because the mean of its divisors is an integer number (601700551002).
Almost surely, 21203401102003 is an apocalyptic number.
1203401102003 is a deficient number, since it is larger than the sum of its proper divisors (1).
1203401102003 is an equidigital number, since it uses as much as digits as its factorization.
1203401102003 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 1203401102003 its reverse (3002011043021), we get a palindrome (4205412145024).
The spelling of 1203401102003 in words is "one trillion, two hundred three billion, four hundred one million, one hundred two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •