Base | Representation |
---|---|
bin | 10000000010010101000… |
… | …010001101011001100101 |
3 | 10220100111010000120111122 |
4 | 100002111002031121211 |
5 | 121023410033342013 |
6 | 2202131325543325 |
7 | 142421612356064 |
oct | 20022502153145 |
9 | 3810433016448 |
10 | 1102012012133 |
11 | 3953a706253a |
12 | 1596b1714b45 |
13 | 7cbc4899cb6 |
14 | 3b4a27ac1db |
15 | 1d9ec437a08 |
hex | 1009508d665 |
1102012012133 has 2 divisors, whose sum is σ = 1102012012134. Its totient is φ = 1102012012132.
The previous prime is 1102012012111. The next prime is 1102012012159. The reversal of 1102012012133 is 3312102102011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1100816443204 + 1195568929 = 1049198^2 + 34577^2 .
It is a cyclic number.
It is not a de Polignac number, because 1102012012133 - 210 = 1102012011109 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1102012012333) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551006006066 + 551006006067.
It is an arithmetic number, because the mean of its divisors is an integer number (551006006067).
Almost surely, 21102012012133 is an apocalyptic number.
It is an amenable number.
1102012012133 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102012012133 is an equidigital number, since it uses as much as digits as its factorization.
1102012012133 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 17.
Adding to 1102012012133 its reverse (3312102102011), we get a palindrome (4414114114144).
The spelling of 1102012012133 in words is "one trillion, one hundred two billion, twelve million, twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •