Base | Representation |
---|---|
bin | 1001000111000000101… |
… | …00011110111010100001 |
3 | 1002220220120210220111012 |
4 | 10203200110132322201 |
5 | 20112011241024301 |
6 | 355442444030305 |
7 | 31420313355542 |
oct | 4434024367241 |
9 | 1086816726435 |
10 | 313001111201 |
11 | 110819a705a9 |
12 | 507b3532395 |
13 | 236924cc30c |
14 | 11213aba4c9 |
15 | 821dc7eebb |
hex | 48e051eea1 |
313001111201 has 2 divisors, whose sum is σ = 313001111202. Its totient is φ = 313001111200.
The previous prime is 313001111141. The next prime is 313001111219. The reversal of 313001111201 is 102111100313.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 178641475600 + 134359635601 = 422660^2 + 366551^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-313001111201 is a prime.
It is a super-2 number, since 2×3130011112012 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (313007111201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156500555600 + 156500555601.
It is an arithmetic number, because the mean of its divisors is an integer number (156500555601).
Almost surely, 2313001111201 is an apocalyptic number.
It is an amenable number.
313001111201 is a deficient number, since it is larger than the sum of its proper divisors (1).
313001111201 is an equidigital number, since it uses as much as digits as its factorization.
313001111201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 313001111201 its reverse (102111100313), we get a palindrome (415112211514).
The spelling of 313001111201 in words is "three hundred thirteen billion, one million, one hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •