Base | Representation |
---|---|
bin | 1001000101010110110… |
… | …00101001110111110101 |
3 | 1002211121200200210201002 |
4 | 10202223120221313311 |
5 | 20103201412342323 |
6 | 355214401013045 |
7 | 31356310554632 |
oct | 4425330516765 |
9 | 1084550623632 |
10 | 312113012213 |
11 | 1104037276a2 |
12 | 505a6024185 |
13 | 23580511862 |
14 | 1116bb7b189 |
15 | 81bad04828 |
hex | 48ab629df5 |
312113012213 has 4 divisors (see below), whose sum is σ = 319725524748. Its totient is φ = 304500499680.
The previous prime is 312113012209. The next prime is 312113012221. The reversal of 312113012213 is 312210311213.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 65945212804 + 246167799409 = 256798^2 + 496153^2 .
It is a cyclic number.
It is not a de Polignac number, because 312113012213 - 22 = 312113012209 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 (312113012243) 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, 3806256206 + ... + 3806256287.
It is an arithmetic number, because the mean of its divisors is an integer number (79931381187).
Almost surely, 2312113012213 is an apocalyptic number.
It is an amenable number.
312113012213 is a deficient number, since it is larger than the sum of its proper divisors (7612512535).
312113012213 is an equidigital number, since it uses as much as digits as its factorization.
312113012213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7612512534.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 312113012213 its reverse (312210311213), we get a palindrome (624323323426).
The spelling of 312113012213 in words is "three hundred twelve billion, one hundred thirteen million, twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •