Base | Representation |
---|---|
bin | 1110001100011001000100… |
… | …10100101110110111000001 |
3 | 11002111211220010201010212101 |
4 | 13012030202110232313001 |
5 | 13042334341404401233 |
6 | 150214350421230401 |
7 | 6401000004530206 |
oct | 706144224566701 |
9 | 132454803633771 |
10 | 31212103200193 |
11 | 9a43a84616633 |
12 | 3601146262401 |
13 | 145539a382a76 |
14 | 79c9610b7cad |
15 | 391d7231cc7d |
hex | 1c632252edc1 |
31212103200193 has 4 divisors (see below), whose sum is σ = 31213221180160. Its totient is φ = 31210985220228.
The previous prime is 31212103200181. The next prime is 31212103200197. The reversal of 31212103200193 is 39100230121213.
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 31212103200193 - 221 = 31212101103041 is a prime.
It is a super-2 number, since 2×312121032001932 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31212103200197) 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, 558948105 + ... + 559003942.
It is an arithmetic number, because the mean of its divisors is an integer number (7803305295040).
Almost surely, 231212103200193 is an apocalyptic number.
It is an amenable number.
31212103200193 is a deficient number, since it is larger than the sum of its proper divisors (1117979967).
31212103200193 is a wasteful number, since it uses less digits than its factorization.
31212103200193 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1117979966.
The product of its (nonzero) digits is 1944, while the sum is 28.
The spelling of 31212103200193 in words is "thirty-one trillion, two hundred twelve billion, one hundred three million, two hundred thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •