Base | Representation |
---|---|
bin | 1110001111100101110010… |
… | …11001100111000101110111 |
3 | 11002220100120212112202001102 |
4 | 13013302321121213011313 |
5 | 13101134440034133421 |
6 | 150341044512520315 |
7 | 6411640441224350 |
oct | 707627131470567 |
9 | 132810525482042 |
10 | 31322012021111 |
11 | 9a8665524a529 |
12 | 361a4ba55009b |
13 | 1462864a07146 |
14 | 7a3dca124d27 |
15 | 394b5640460b |
hex | 1c7cb9667177 |
31322012021111 has 8 divisors (see below), whose sum is σ = 36330862558080. Its totient is φ = 26446730831928.
The previous prime is 31322012021087. The next prime is 31322012021123. The reversal of 31322012021111 is 11112021022313.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31322012021111 is a prime.
It is a super-2 number, since 2×313220120211112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31322012023111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33392336441 + ... + 33392337378.
It is an arithmetic number, because the mean of its divisors is an integer number (4541357819760).
Almost surely, 231322012021111 is an apocalyptic number.
31322012021111 is a deficient number, since it is larger than the sum of its proper divisors (5008850536969).
31322012021111 is an equidigital number, since it uses as much as digits as its factorization.
31322012021111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66784673893.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 31322012021111 its reverse (11112021022313), we get a palindrome (42434033043424).
The spelling of 31322012021111 in words is "thirty-one trillion, three hundred twenty-two billion, twelve million, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •