Base | Representation |
---|---|
bin | 101101101100111101000100… |
… | …011110011011111101010111 |
3 | 222100200112112211002212000021 |
4 | 231230331010132123331113 |
5 | 202321201202232040111 |
6 | 1551254422211130011 |
7 | 60223603112131051 |
oct | 5554750436337527 |
9 | 870615484085007 |
10 | 201001323315031 |
11 | 59055200a10428 |
12 | 1a6634a05a3907 |
13 | 8820460766965 |
14 | 378c731ada8d1 |
15 | 183878ba9dd71 |
hex | b6cf4479bf57 |
201001323315031 has 2 divisors, whose sum is σ = 201001323315032. Its totient is φ = 201001323315030.
The previous prime is 201001323314999. The next prime is 201001323315071. The reversal of 201001323315031 is 130513323100102.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 201001323315031 - 25 = 201001323314999 is a prime.
It is a super-2 number, since 2×2010013233150312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201001323314987 and 201001323315005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201001323315071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100500661657515 + 100500661657516.
It is an arithmetic number, because the mean of its divisors is an integer number (100500661657516).
Almost surely, 2201001323315031 is an apocalyptic number.
201001323315031 is a deficient number, since it is larger than the sum of its proper divisors (1).
201001323315031 is an equidigital number, since it uses as much as digits as its factorization.
201001323315031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1620, while the sum is 25.
Adding to 201001323315031 its reverse (130513323100102), we get a palindrome (331514646415133).
The spelling of 201001323315031 in words is "two hundred one trillion, one billion, three hundred twenty-three million, three hundred fifteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •