Base | Representation |
---|---|
bin | 1001000111000000101… |
… | …00110101001000101101 |
3 | 1002220220120222112100022 |
4 | 10203200110311020231 |
5 | 20112011301432341 |
6 | 355442450011525 |
7 | 31420314215111 |
oct | 4434024651055 |
9 | 1086816875308 |
10 | 313001202221 |
11 | 11081a022a24 |
12 | 507b3576ba5 |
13 | 23692531886 |
14 | 11213b01741 |
15 | 821dc9be4b |
hex | 48e053522d |
313001202221 has 2 divisors, whose sum is σ = 313001202222. Its totient is φ = 313001202220.
The previous prime is 313001202197. The next prime is 313001202223. The reversal of 313001202221 is 122202100313.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 305842180900 + 7159021321 = 553030^2 + 84611^2 .
It is a cyclic number.
It is not a de Polignac number, because 313001202221 - 226 = 312934093357 is a prime.
Together with 313001202223, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 313001202221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (313001202223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156500601110 + 156500601111.
It is an arithmetic number, because the mean of its divisors is an integer number (156500601111).
Almost surely, 2313001202221 is an apocalyptic number.
It is an amenable number.
313001202221 is a deficient number, since it is larger than the sum of its proper divisors (1).
313001202221 is an equidigital number, since it uses as much as digits as its factorization.
313001202221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 313001202221 its reverse (122202100313), we get a palindrome (435203302534).
The spelling of 313001202221 in words is "three hundred thirteen billion, one million, two hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •