Base | Representation |
---|---|
bin | 100011100001000111001010… |
… | …0110110011001010110011001 |
3 | 1111222011111110102022201011022 |
4 | 1013002032110312121112121 |
5 | 311422043111044300241 |
6 | 3024241022244412225 |
7 | 122543114134544162 |
oct | 10702162466312631 |
9 | 1458144412281138 |
10 | 312414123431321 |
11 | 905aa0a406a70a |
12 | 2b057b499a7075 |
13 | 105426aa49a592 |
14 | 5720cd2220769 |
15 | 261b91d03d54b |
hex | 11c2394d99599 |
312414123431321 has 16 divisors (see below), whose sum is σ = 332749467590400. Its totient is φ = 292297426460928.
The previous prime is 312414123431279. The next prime is 312414123431339. The reversal of 312414123431321 is 123134321414213.
It is a cyclic number.
It is not a de Polignac number, because 312414123431321 - 230 = 312413049689497 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (312414123431021) 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 15 ways as a sum of consecutive naturals, for example, 7781906 + ... + 26179883.
It is an arithmetic number, because the mean of its divisors is an integer number (20796841724400).
Almost surely, 2312414123431321 is an apocalyptic number.
It is an amenable number.
312414123431321 is a deficient number, since it is larger than the sum of its proper divisors (20335344159079).
312414123431321 is a wasteful number, since it uses less digits than its factorization.
312414123431321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33965008.
The product of its digits is 41472, while the sum is 35.
Adding to 312414123431321 its reverse (123134321414213), we get a palindrome (435548444845534).
The spelling of 312414123431321 in words is "three hundred twelve trillion, four hundred fourteen billion, one hundred twenty-three million, four hundred thirty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •