Base | Representation |
---|---|
bin | 1001000110011101010… |
… | …00101001011010101101 |
3 | 1002220010220111210010121 |
4 | 10203032220221122231 |
5 | 20110404312012323 |
6 | 355353204404541 |
7 | 31410051414412 |
oct | 4431650513255 |
9 | 1086126453117 |
10 | 312704407213 |
11 | 1106875384a0 |
12 | 507300a6751 |
13 | 23645bb6823 |
14 | 111c6524109 |
15 | 8202bc2a5d |
hex | 48cea296ad |
312704407213 has 4 divisors (see below), whose sum is σ = 341132080608. Its totient is φ = 284276733820.
The previous prime is 312704407163. The next prime is 312704407219.
312704407213 is nontrivially palindromic in base 10.
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 312704407213 - 29 = 312704406701 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (312704407219) 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, 14213836681 + ... + 14213836702.
It is an arithmetic number, because the mean of its divisors is an integer number (85283020152).
Almost surely, 2312704407213 is an apocalyptic number.
It is an amenable number.
312704407213 is a deficient number, since it is larger than the sum of its proper divisors (28427673395).
312704407213 is a wasteful number, since it uses less digits than its factorization.
312704407213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28427673394.
The product of its (nonzero) digits is 28224, while the sum is 34.
It can be divided in two parts, 312704 and 407213, that added together give a palindrome (719917).
The spelling of 312704407213 in words is "three hundred twelve billion, seven hundred four million, four hundred seven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •