Base | Representation |
---|---|
bin | 100011100001000110001011… |
… | …0010010111101110011000101 |
3 | 1111222011021222110010002211122 |
4 | 1013002030112102331303011 |
5 | 311422024234023323323 |
6 | 3024240031440443325 |
7 | 122543010413521634 |
oct | 10702142622756305 |
9 | 1458137873102748 |
10 | 312412000214213 |
11 | 905a9204614229 |
12 | 2b057656919545 |
13 | 1054242c640bb3 |
14 | 5720b7024d51b |
15 | 261b84693bec8 |
hex | 11c23164bdcc5 |
312412000214213 has 64 divisors (see below), whose sum is σ = 355529660645376. Its totient is φ = 273130780032000.
The previous prime is 312412000214189. The next prime is 312412000214407.
It is a happy number.
312412000214213 is nontrivially palindromic in base 10.
It is a cyclic number.
It is not a de Polignac number, because 312412000214213 - 210 = 312412000213189 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (312412000214813) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 229784048 + ... + 231139638.
It is an arithmetic number, because the mean of its divisors is an integer number (5555150947584).
Almost surely, 2312412000214213 is an apocalyptic number.
It is an amenable number.
312412000214213 is a deficient number, since it is larger than the sum of its proper divisors (43117660431163).
312412000214213 is a wasteful number, since it uses less digits than its factorization.
312412000214213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1355874.
The product of its (nonzero) digits is 2304, while the sum is 26.
It can be divided in two parts, 312412000 and 214213, that added together give a palindrome (312626213).
The spelling of 312412000214213 in words is "three hundred twelve trillion, four hundred twelve billion, two hundred fourteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •