Base | Representation |
---|---|
bin | 10000000010010100011… |
… | …100011110110100010011 |
3 | 10220100110102102002210112 |
4 | 100002110130132310103 |
5 | 121023400020401003 |
6 | 2202130333551535 |
7 | 142421432324636 |
oct | 20022434366423 |
9 | 3810412362715 |
10 | 1102002122003 |
11 | 3953a1517982 |
12 | 1596aa3455ab |
13 | 7cbc2816453 |
14 | 3b4a1355c1d |
15 | 1d9eb6323d8 |
hex | 1009471ed13 |
1102002122003 has 2 divisors, whose sum is σ = 1102002122004. Its totient is φ = 1102002122002.
The previous prime is 1102002121991. The next prime is 1102002122101. The reversal of 1102002122003 is 3002212002011.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1102002122003 - 212 = 1102002117907 is a prime.
It is a super-2 number, since 2×11020021220032 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1102002122303) 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, 551001061001 + 551001061002.
It is an arithmetic number, because the mean of its divisors is an integer number (551001061002).
Almost surely, 21102002122003 is an apocalyptic number.
1102002122003 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102002122003 is an equidigital number, since it uses as much as digits as its factorization.
1102002122003 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 1102002122003 its reverse (3002212002011), we get a palindrome (4104214124014).
The spelling of 1102002122003 in words is "one trillion, one hundred two billion, two million, one hundred twenty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •