Base | Representation |
---|---|
bin | 101101101110110111101110… |
… | …111011111101100000100111 |
3 | 222101011010111211121110102112 |
4 | 231232313232323331200213 |
5 | 202330330422220401411 |
6 | 1551435123413431235 |
7 | 60236245016155025 |
oct | 5556675673754047 |
9 | 871133454543375 |
10 | 201133032200231 |
11 | 590a604917127a |
12 | 1a684b1963b51b |
13 | 882c9c06a9061 |
14 | 3794c68121715 |
15 | 183bde996db8b |
hex | b6edeeefd827 |
201133032200231 has 2 divisors, whose sum is σ = 201133032200232. Its totient is φ = 201133032200230.
The previous prime is 201133032200161. The next prime is 201133032200237. The reversal of 201133032200231 is 132002230331102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 201133032200231 - 246 = 130764288022567 is a prime.
It is a super-2 number, since 2×2011330322002312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201133032200197 and 201133032200206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201133032200237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100566516100115 + 100566516100116.
It is an arithmetic number, because the mean of its divisors is an integer number (100566516100116).
Almost surely, 2201133032200231 is an apocalyptic number.
201133032200231 is a deficient number, since it is larger than the sum of its proper divisors (1).
201133032200231 is an equidigital number, since it uses as much as digits as its factorization.
201133032200231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 201133032200231 its reverse (132002230331102), we get a palindrome (333135262531333).
The spelling of 201133032200231 in words is "two hundred one trillion, one hundred thirty-three billion, thirty-two million, two hundred thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •