Base | Representation |
---|---|
bin | 101101110001110010001001… |
… | …110111111010011110001111 |
3 | 222101212021011212211111122112 |
4 | 231301302021313322132033 |
5 | 202342120343211301221 |
6 | 1552111110102334235 |
7 | 60256562246235263 |
oct | 5561621167723617 |
9 | 871767155744575 |
10 | 201333200103311 |
11 | 59172a26792551 |
12 | 1a6b788142a37b |
13 | 8845840724c63 |
14 | 37a081662c0a3 |
15 | 1842212a0c15b |
hex | b71c89dfa78f |
201333200103311 has 2 divisors, whose sum is σ = 201333200103312. Its totient is φ = 201333200103310.
The previous prime is 201333200103209. The next prime is 201333200103341. The reversal of 201333200103311 is 113301002333102.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201333200103311 is a prime.
It is a super-2 number, since 2×2013332001033112 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201333200103341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100666600051655 + 100666600051656.
It is an arithmetic number, because the mean of its divisors is an integer number (100666600051656).
Almost surely, 2201333200103311 is an apocalyptic number.
201333200103311 is a deficient number, since it is larger than the sum of its proper divisors (1).
201333200103311 is an equidigital number, since it uses as much as digits as its factorization.
201333200103311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 201333200103311 its reverse (113301002333102), we get a palindrome (314634202436413).
The spelling of 201333200103311 in words is "two hundred one trillion, three hundred thirty-three billion, two hundred million, one hundred three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •