Base | Representation |
---|---|
bin | 1110001111100101110001… |
… | …10111101010011110110111 |
3 | 11002220100120020210121220112 |
4 | 13013302320313222132313 |
5 | 13101134430244401403 |
6 | 150341043554053235 |
7 | 6411640302461621 |
oct | 707627067523667 |
9 | 132810506717815 |
10 | 31322003122103 |
11 | 9a86650221581 |
12 | 361a4b757a21b |
13 | 1462862c0c765 |
14 | 7a3dc8c89c11 |
15 | 394b557479d8 |
hex | 1c7cb8dea7b7 |
31322003122103 has 4 divisors (see below), whose sum is σ = 31322690068800. Its totient is φ = 31321316175408.
The previous prime is 31322003122049. The next prime is 31322003122127. The reversal of 31322003122103 is 30122130022313.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 31322003122103 - 238 = 31047125215159 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31322003122153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 343404950 + ... + 343496147.
It is an arithmetic number, because the mean of its divisors is an integer number (7830672517200).
Almost surely, 231322003122103 is an apocalyptic number.
31322003122103 is a deficient number, since it is larger than the sum of its proper divisors (686946697).
31322003122103 is an equidigital number, since it uses as much as digits as its factorization.
31322003122103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 686946696.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 31322003122103 its reverse (30122130022313), we get a palindrome (61444133144416).
The spelling of 31322003122103 in words is "thirty-one trillion, three hundred twenty-two billion, three million, one hundred twenty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •