Base | Representation |
---|---|
bin | 101101101101000110000110… |
… | …100000001011010110010101 |
3 | 222100201110120200000101210122 |
4 | 231231012012200023112111 |
5 | 202321331032334032013 |
6 | 1551303104354201325 |
7 | 60224365326121226 |
oct | 5555060640132625 |
9 | 870643520011718 |
10 | 201011021002133 |
11 | 59059328011271 |
12 | 1a665348283245 |
13 | 8821347926654 |
14 | 378cdb1a4724d |
15 | 1838b58142a08 |
hex | b6d18680b595 |
201011021002133 has 2 divisors, whose sum is σ = 201011021002134. Its totient is φ = 201011021002132.
The previous prime is 201011021002093. The next prime is 201011021002157. The reversal of 201011021002133 is 331200120110102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 185331139595044 + 15679881407089 = 13613638^2 + 3959783^2 .
It is a cyclic number.
It is not a de Polignac number, because 201011021002133 - 222 = 201011016807829 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201011021002733) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100505510501066 + 100505510501067.
It is an arithmetic number, because the mean of its divisors is an integer number (100505510501067).
Almost surely, 2201011021002133 is an apocalyptic number.
It is an amenable number.
201011021002133 is a deficient number, since it is larger than the sum of its proper divisors (1).
201011021002133 is an equidigital number, since it uses as much as digits as its factorization.
201011021002133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 201011021002133 its reverse (331200120110102), we get a palindrome (532211141112235).
The spelling of 201011021002133 in words is "two hundred one trillion, eleven billion, twenty-one million, two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •