Base | Representation |
---|---|
bin | 1001000101100100111… |
… | …10100110010111001101 |
3 | 1002211220222121120122110 |
4 | 10202302132212113031 |
5 | 20103422343324323 |
6 | 355234251334233 |
7 | 31362254206533 |
oct | 4426236462715 |
9 | 1084828546573 |
10 | 312232011213 |
11 | 110464915381 |
12 | 50619a51379 |
13 | 2359c077c75 |
14 | 1117d8b6153 |
15 | 81c64ad793 |
hex | 48b27a65cd |
312232011213 has 8 divisors (see below), whose sum is σ = 416318464800. Its totient is φ = 208150115888.
The previous prime is 312232011211. The next prime is 312232011229. The reversal of 312232011213 is 312110232213.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 312232011213 - 21 = 312232011211 is a prime.
It is a super-2 number, since 2×3122320112132 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 312232011213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (312232011211) 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, 976398 + ... + 1256111.
It is an arithmetic number, because the mean of its divisors is an integer number (52039808100).
Almost surely, 2312232011213 is an apocalyptic number.
It is an amenable number.
312232011213 is a deficient number, since it is larger than the sum of its proper divisors (104086453587).
312232011213 is a wasteful number, since it uses less digits than its factorization.
312232011213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2279131.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 312232011213 its reverse (312110232213), we get a palindrome (624342243426).
The spelling of 312232011213 in words is "three hundred twelve billion, two hundred thirty-two million, eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •