Base | Representation |
---|---|
bin | 1110001001011110111111… |
… | …01001000010011101111101 |
3 | 11002011022000201121000020020 |
4 | 13010233133221002131331 |
5 | 13034220241222431414 |
6 | 150100425241242353 |
7 | 6360532216206135 |
oct | 704573751023575 |
9 | 132138021530206 |
10 | 31112200202109 |
11 | 9a05678a14504 |
12 | 35a5904a933b9 |
13 | 1448b389a7310 |
14 | 797ba4ca7ac5 |
15 | 38e4768947a9 |
hex | 1c4bdfa4277d |
31112200202109 has 8 divisors (see below), whose sum is σ = 44673928495392. Its totient is φ = 19145969355120.
The previous prime is 31112200202011. The next prime is 31112200202117. The reversal of 31112200202109 is 90120200221113.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 31112200202109 - 29 = 31112200201597 is a prime.
It is a super-2 number, since 2×311122002021092 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31112200202309) 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, 398874361527 + ... + 398874361604.
It is an arithmetic number, because the mean of its divisors is an integer number (5584241061924).
Almost surely, 231112200202109 is an apocalyptic number.
31112200202109 is a gapful number since it is divisible by the number (39) formed by its first and last digit.
It is an amenable number.
31112200202109 is a deficient number, since it is larger than the sum of its proper divisors (13561728293283).
31112200202109 is a wasteful number, since it uses less digits than its factorization.
31112200202109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 797748723147.
The product of its (nonzero) digits is 432, while the sum is 24.
The spelling of 31112200202109 in words is "thirty-one trillion, one hundred twelve billion, two hundred million, two hundred two thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •