Base | Representation |
---|---|
bin | 1011101101001010011… |
… | …1010111110101010101 |
3 | 201020002010221201111022 |
4 | 2323102213113311111 |
5 | 11243324110012323 |
6 | 232215054250525 |
7 | 20346332032625 |
oct | 2732247276525 |
9 | 636063851438 |
10 | 201102032213 |
11 | 78317944325 |
12 | 32b847b6a45 |
13 | 15c6b731b44 |
14 | 9a3a5cc885 |
15 | 53700ac4c8 |
hex | 2ed29d7d55 |
201102032213 has 2 divisors, whose sum is σ = 201102032214. Its totient is φ = 201102032212.
The previous prime is 201102032179. The next prime is 201102032249. The reversal of 201102032213 is 312230201102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 198932056324 + 2169975889 = 446018^2 + 46583^2 .
It is a cyclic number.
It is not a de Polignac number, because 201102032213 - 26 = 201102032149 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201102032191 and 201102032200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201102032293) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100551016106 + 100551016107.
It is an arithmetic number, because the mean of its divisors is an integer number (100551016107).
Almost surely, 2201102032213 is an apocalyptic number.
It is an amenable number.
201102032213 is a deficient number, since it is larger than the sum of its proper divisors (1).
201102032213 is an equidigital number, since it uses as much as digits as its factorization.
201102032213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 201102032213 its reverse (312230201102), we get a palindrome (513332233315).
The spelling of 201102032213 in words is "two hundred one billion, one hundred two million, thirty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •