Base | Representation |
---|---|
bin | 1110001100011001000100… |
… | …10000111101110111101111 |
3 | 11002111211220001211222211111 |
4 | 13012030202100331313233 |
5 | 13042334341131304403 |
6 | 150214350344132451 |
7 | 6400666663246330 |
oct | 706144220756757 |
9 | 132454801758744 |
10 | 31212102213103 |
11 | 9a43a84001a59 |
12 | 3601145a67127 |
13 | 145539a0c86a6 |
14 | 79c960cdc287 |
15 | 391d721c556d |
hex | 1c632243ddef |
31212102213103 has 8 divisors (see below), whose sum is σ = 35687619319808. Its totient is φ = 26740746446904.
The previous prime is 31212102213101. The next prime is 31212102213109. The reversal of 31212102213103 is 30131220121213.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 31212102213103 - 21 = 31212102213101 is a prime.
It is a super-2 number, since 2×312121022131032 (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 (31212102213101) 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, 1040319051 + ... + 1040349052.
It is an arithmetic number, because the mean of its divisors is an integer number (4460952414976).
Almost surely, 231212102213103 is an apocalyptic number.
31212102213103 is a deficient number, since it is larger than the sum of its proper divisors (4475517106705).
31212102213103 is a wasteful number, since it uses less digits than its factorization.
31212102213103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2080670253.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 31212102213103 its reverse (30131220121213), we get a palindrome (61343322334316).
The spelling of 31212102213103 in words is "thirty-one trillion, two hundred twelve billion, one hundred two million, two hundred thirteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •