Base | Representation |
---|---|
bin | 10000000010010101000… |
… | …111001101001100100111 |
3 | 10220100111012111010100002 |
4 | 100002111013031030213 |
5 | 121023410402301043 |
6 | 2202131414011515 |
7 | 142421626453025 |
oct | 20022507151447 |
9 | 3810435433302 |
10 | 1102013322023 |
11 | 3953a7877699 |
12 | 1596b2046b9b |
13 | 7cbc4c38293 |
14 | 3b4a2a2d715 |
15 | 1d9ec5e5bb8 |
hex | 100951cd327 |
1102013322023 has 2 divisors, whose sum is σ = 1102013322024. Its totient is φ = 1102013322022.
The previous prime is 1102013322001. The next prime is 1102013322029. The reversal of 1102013322023 is 3202233102011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1102013322023 - 224 = 1101996544807 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 1102013321986 and 1102013322004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1102013322029) 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, 551006661011 + 551006661012.
It is an arithmetic number, because the mean of its divisors is an integer number (551006661012).
Almost surely, 21102013322023 is an apocalyptic number.
1102013322023 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102013322023 is an equidigital number, since it uses as much as digits as its factorization.
1102013322023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 1102013322023 its reverse (3202233102011), we get a palindrome (4304246424034).
The spelling of 1102013322023 in words is "one trillion, one hundred two billion, thirteen million, three hundred twenty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •