Base | Representation |
---|---|
bin | 1001000111000011000… |
… | …00110010001010101001 |
3 | 1002220221222110002210121 |
4 | 10203201200302022221 |
5 | 20112031401104001 |
6 | 355444440443241 |
7 | 31420645363042 |
oct | 4434140621251 |
9 | 1086858402717 |
10 | 313021113001 |
11 | 11082a292213 |
12 | 507ba179521 |
13 | 236966b34bc |
14 | 112166058c9 |
15 | 82208d16a1 |
hex | 48e18322a9 |
313021113001 has 2 divisors, whose sum is σ = 313021113002. Its totient is φ = 313021113000.
The previous prime is 313021112977. The next prime is 313021113017. The reversal of 313021113001 is 100311120313.
It is an a-pointer prime, because the next prime (313021113017) can be obtained adding 313021113001 to its sum of digits (16).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 181730837401 + 131290275600 = 426299^2 + 362340^2 .
It is a cyclic number.
It is not a de Polignac number, because 313021113001 - 25 = 313021112969 is a prime.
It is a super-2 number, since 2×3130211130012 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (313021111001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156510556500 + 156510556501.
It is an arithmetic number, because the mean of its divisors is an integer number (156510556501).
Almost surely, 2313021113001 is an apocalyptic number.
It is an amenable number.
313021113001 is a deficient number, since it is larger than the sum of its proper divisors (1).
313021113001 is an equidigital number, since it uses as much as digits as its factorization.
313021113001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 313021113001 its reverse (100311120313), we get a palindrome (413332233314).
The spelling of 313021113001 in words is "three hundred thirteen billion, twenty-one million, one hundred thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •