Base | Representation |
---|---|
bin | 101101110001100111000101… |
… | …010111010111001100111101 |
3 | 222101211010111110201101202112 |
4 | 231301213011113113030331 |
5 | 202341422022201120214 |
6 | 1552101422355103405 |
7 | 60255661551132665 |
oct | 5561470527271475 |
9 | 871733443641675 |
10 | 201321313301309 |
11 | 59168986a17243 |
12 | 1a6b55045a1b65 |
13 | 8844697b752c6 |
14 | 37a0009a791a5 |
15 | 1841c6919ba3e |
hex | b719c55d733d |
201321313301309 has 2 divisors, whose sum is σ = 201321313301310. Its totient is φ = 201321313301308.
The previous prime is 201321313301287. The next prime is 201321313301393. The reversal of 201321313301309 is 903103313123102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 181286782061284 + 20034531240025 = 13464278^2 + 4475995^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201321313301309 is a prime.
It is a super-2 number, since 2×2013213133013092 (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 (201321313301509) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100660656650654 + 100660656650655.
It is an arithmetic number, because the mean of its divisors is an integer number (100660656650655).
Almost surely, 2201321313301309 is an apocalyptic number.
It is an amenable number.
201321313301309 is a deficient number, since it is larger than the sum of its proper divisors (1).
201321313301309 is an equidigital number, since it uses as much as digits as its factorization.
201321313301309 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8748, while the sum is 32.
The spelling of 201321313301309 in words is "two hundred one trillion, three hundred twenty-one billion, three hundred thirteen million, three hundred one thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •