Base | Representation |
---|---|
bin | 1110001111100110000000… |
… | …00001011010110111110001 |
3 | 11002220100212121121011020021 |
4 | 13013303000001122313301 |
5 | 13101140202004320423 |
6 | 150341103522043441 |
7 | 6411643260444220 |
oct | 707630001326761 |
9 | 132810777534207 |
10 | 31322123120113 |
11 | 9a86701a31891 |
12 | 361a52b7a9581 |
13 | 1462881a357b7 |
14 | 7a3ddaba4cb7 |
15 | 394b6104c95d |
hex | 1c7cc005adf1 |
31322123120113 has 4 divisors (see below), whose sum is σ = 35796712137280. Its totient is φ = 26847534102948.
The previous prime is 31322123120083. The next prime is 31322123120153. The reversal of 31322123120113 is 31102132122313.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 31322123120113 - 29 = 31322123119601 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31322123120153) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2237294508573 + ... + 2237294508586.
It is an arithmetic number, because the mean of its divisors is an integer number (8949178034320).
Almost surely, 231322123120113 is an apocalyptic number.
It is an amenable number.
31322123120113 is a deficient number, since it is larger than the sum of its proper divisors (4474589017167).
31322123120113 is an equidigital number, since it uses as much as digits as its factorization.
31322123120113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4474589017166.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 31322123120113 its reverse (31102132122313), we get a palindrome (62424255242426).
The spelling of 31322123120113 in words is "thirty-one trillion, three hundred twenty-two billion, one hundred twenty-three million, one hundred twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •