Base | Representation |
---|---|
bin | 1001000101101111111… |
… | …10010100001000011111 |
3 | 1002212011102002211021221 |
4 | 10202313332110020133 |
5 | 20104114444224411 |
6 | 355251343434211 |
7 | 31364453664334 |
oct | 4426776241037 |
9 | 1085142084257 |
10 | 312324211231 |
11 | 11050196963a |
12 | 506448b5967 |
13 | 235b51ba3a6 |
14 | 1118bc3698b |
15 | 81ce622071 |
hex | 48b7f9421f |
312324211231 has 8 divisors (see below), whose sum is σ = 313419511440. Its totient is φ = 311230033728.
The previous prime is 312324211217. The next prime is 312324211301. The reversal of 312324211231 is 132112423213.
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 312324211231 - 27 = 312324211103 is a prime.
It is a super-2 number, since 2×3123242112312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 312324211196 and 312324211205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (312324211931) 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, 278625 + ... + 838021.
It is an arithmetic number, because the mean of its divisors is an integer number (39177438930).
Almost surely, 2312324211231 is an apocalyptic number.
312324211231 is a deficient number, since it is larger than the sum of its proper divisors (1095300209).
312324211231 is a wasteful number, since it uses less digits than its factorization.
312324211231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 561353.
The product of its digits is 1728, while the sum is 25.
Adding to 312324211231 its reverse (132112423213), we get a palindrome (444436634444).
The spelling of 312324211231 in words is "three hundred twelve billion, three hundred twenty-four million, two hundred eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •