Base | Representation |
---|---|
bin | 101101111011101001110001… |
… | …111011100010110001010111 |
3 | 222111021002202000200020100222 |
4 | 231323221301323202301113 |
5 | 202434223323212000031 |
6 | 1553350431341224555 |
7 | 60356561614601102 |
oct | 5573516173426127 |
9 | 874232660606328 |
10 | 202011403234391 |
11 | 59404611776993 |
12 | 1a7a71b626215b |
13 | 889479415240a |
14 | 37c5592b4b739 |
15 | 1854ba820ce7b |
hex | b7ba71ee2c57 |
202011403234391 has 2 divisors, whose sum is σ = 202011403234392. Its totient is φ = 202011403234390.
The previous prime is 202011403234307. The next prime is 202011403234393. The reversal of 202011403234391 is 193432304110202.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 202011403234391 - 214 = 202011403218007 is a prime.
Together with 202011403234393, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (202011403234393) 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, 101005701617195 + 101005701617196.
It is an arithmetic number, because the mean of its divisors is an integer number (101005701617196).
Almost surely, 2202011403234391 is an apocalyptic number.
202011403234391 is a deficient number, since it is larger than the sum of its proper divisors (1).
202011403234391 is an equidigital number, since it uses as much as digits as its factorization.
202011403234391 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31104, while the sum is 35.
Adding to 202011403234391 its reverse (193432304110202), we get a palindrome (395443707344593).
The spelling of 202011403234391 in words is "two hundred two trillion, eleven billion, four hundred three million, two hundred thirty-four thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •