Base | Representation |
---|---|
bin | 101101101100111101000011… |
… | …110100100000010101110101 |
3 | 222100200112112001102101200112 |
4 | 231230331003310200111311 |
5 | 202321201141423313213 |
6 | 1551254421135352405 |
7 | 60223602616530113 |
oct | 5554750364402565 |
9 | 870615461371615 |
10 | 201001312322933 |
11 | 590551a5792951 |
12 | 1a663498982705 |
13 | 882045b3b8665 |
14 | 378c730478ab3 |
15 | 183878ab2bea8 |
hex | b6cf43d20575 |
201001312322933 has 2 divisors, whose sum is σ = 201001312322934. Its totient is φ = 201001312322932.
The previous prime is 201001312322891. The next prime is 201001312322957. The reversal of 201001312322933 is 339223213100102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 161559809941924 + 39441502381009 = 12710618^2 + 6280247^2 .
It is a cyclic number.
It is not a de Polignac number, because 201001312322933 - 222 = 201001308128629 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 201001312322933.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201001312322983) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100500656161466 + 100500656161467.
It is an arithmetic number, because the mean of its divisors is an integer number (100500656161467).
Almost surely, 2201001312322933 is an apocalyptic number.
It is an amenable number.
201001312322933 is a deficient number, since it is larger than the sum of its proper divisors (1).
201001312322933 is an equidigital number, since it uses as much as digits as its factorization.
201001312322933 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 32.
The spelling of 201001312322933 in words is "two hundred one trillion, one billion, three hundred twelve million, three hundred twenty-two thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •