Base | Representation |
---|---|
bin | 1001000101110000111… |
… | …11111000100100001101 |
3 | 1002212012000122220121012 |
4 | 10202320133320210031 |
5 | 20104124222324323 |
6 | 355252300215005 |
7 | 31364621535266 |
oct | 4427037704415 |
9 | 1085160586535 |
10 | 312333011213 |
11 | 11050692a153 |
12 | 5064783a465 |
13 | 235b6c7b992 |
14 | 1118d08796d |
15 | 81d02ae678 |
hex | 48b87f890d |
312333011213 has 4 divisors (see below), whose sum is σ = 312577213440. Its totient is φ = 312088808988.
The previous prime is 312333011201. The next prime is 312333011251. The reversal of 312333011213 is 312110333213.
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 312333011213 - 26 = 312333011149 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 (312333071213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 122099195 + ... + 122101752.
It is an arithmetic number, because the mean of its divisors is an integer number (78144303360).
Almost surely, 2312333011213 is an apocalyptic number.
It is an amenable number.
312333011213 is a deficient number, since it is larger than the sum of its proper divisors (244202227).
312333011213 is a wasteful number, since it uses less digits than its factorization.
312333011213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 244202226.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 312333011213 its reverse (312110333213), we get a palindrome (624443344426).
The spelling of 312333011213 in words is "three hundred twelve billion, three hundred thirty-three million, eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •