Base | Representation |
---|---|
bin | 100011010111100100010011… |
… | …0101011010110100001101011 |
3 | 1111210112002102212221122012021 |
4 | 1012233020212223112201223 |
5 | 311234100012331022011 |
6 | 3021354232254325311 |
7 | 122346254154523633 |
oct | 10657104653264153 |
9 | 1453462385848167 |
10 | 311102310017131 |
11 | 901438266475a6 |
12 | 2aa858661b9837 |
13 | 10478a8baaa039 |
14 | 56b7609b476c3 |
15 | 25e7741e52471 |
hex | 11af226ad686b |
311102310017131 has 2 divisors, whose sum is σ = 311102310017132. Its totient is φ = 311102310017130.
The previous prime is 311102310017117. The next prime is 311102310017153. The reversal of 311102310017131 is 131710013201113.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 311102310017131 - 211 = 311102310015083 is a prime.
It is a super-2 number, since 2×3111023100171312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 311102310017096 and 311102310017105.
It is not a weakly prime, because it can be changed into another prime (311102310017731) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 155551155008565 + 155551155008566.
It is an arithmetic number, because the mean of its divisors is an integer number (155551155008566).
Almost surely, 2311102310017131 is an apocalyptic number.
311102310017131 is a deficient number, since it is larger than the sum of its proper divisors (1).
311102310017131 is an equidigital number, since it uses as much as digits as its factorization.
311102310017131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 378, while the sum is 25.
Adding to 311102310017131 its reverse (131710013201113), we get a palindrome (442812323218244).
The spelling of 311102310017131 in words is "three hundred eleven trillion, one hundred two billion, three hundred ten million, seventeen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •