Base | Representation |
---|---|
bin | 10000000010010100011… |
… | …001011001000100100001 |
3 | 10220100110100212221201122 |
4 | 100002110121121010201 |
5 | 121023344313441113 |
6 | 2202130304342025 |
7 | 142421422412336 |
oct | 20022431310441 |
9 | 3810410787648 |
10 | 1102001312033 |
11 | 3953a1014386 |
12 | 1596aa014915 |
13 | 7cbc25c188b |
14 | 3b4a11c498d |
15 | 1d9eb522408 |
hex | 10094659121 |
1102001312033 has 2 divisors, whose sum is σ = 1102001312034. Its totient is φ = 1102001312032.
The previous prime is 1102001312023. The next prime is 1102001312053. The reversal of 1102001312033 is 3302131002011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 663105661969 + 438895650064 = 814313^2 + 662492^2 .
It is a cyclic number.
It is not a de Polignac number, because 1102001312033 - 210 = 1102001311009 is a prime.
It is not a weakly prime, because it can be changed into another prime (1102001312023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551000656016 + 551000656017.
It is an arithmetic number, because the mean of its divisors is an integer number (551000656017).
Almost surely, 21102001312033 is an apocalyptic number.
It is an amenable number.
1102001312033 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102001312033 is an equidigital number, since it uses as much as digits as its factorization.
1102001312033 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 17.
Adding to 1102001312033 its reverse (3302131002011), we get a palindrome (4404132314044).
The spelling of 1102001312033 in words is "one trillion, one hundred two billion, one million, three hundred twelve thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •