Base | Representation |
---|---|
bin | 1001000111000100001… |
… | …11101110100110101111 |
3 | 1002220222200122202221211 |
4 | 10203202013232212233 |
5 | 20112042004301111 |
6 | 355445443335251 |
7 | 31421131223011 |
oct | 4434207564657 |
9 | 1086880582854 |
10 | 313031322031 |
11 | 11083502542a |
12 | 50801681527 |
13 | 2369884924c |
14 | 11217b021b1 |
15 | 822174b521 |
hex | 48e21ee9af |
313031322031 has 2 divisors, whose sum is σ = 313031322032. Its totient is φ = 313031322030.
The previous prime is 313031322001. The next prime is 313031322053. The reversal of 313031322031 is 130223130313.
It is an a-pointer prime, because the next prime (313031322053) can be obtained adding 313031322031 to its sum of digits (22).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 313031322031 - 27 = 313031321903 is a prime.
It is a super-2 number, since 2×3130313220312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 313031321993 and 313031322011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (313031322001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156515661015 + 156515661016.
It is an arithmetic number, because the mean of its divisors is an integer number (156515661016).
Almost surely, 2313031322031 is an apocalyptic number.
313031322031 is a deficient number, since it is larger than the sum of its proper divisors (1).
313031322031 is an equidigital number, since it uses as much as digits as its factorization.
313031322031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 313031322031 its reverse (130223130313), we get a palindrome (443254452344).
The spelling of 313031322031 in words is "three hundred thirteen billion, thirty-one million, three hundred twenty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •