Base | Representation |
---|---|
bin | 1001000101011010000… |
… | …01001010110011110111 |
3 | 1002211200121020202112202 |
4 | 10202231001022303313 |
5 | 20103230421110403 |
6 | 355221220135115 |
7 | 31360062465104 |
oct | 4425501126367 |
9 | 1084617222482 |
10 | 312140410103 |
11 | 110418140085 |
12 | 505b323749b |
13 | 235860b5322 |
14 | 1117166daab |
15 | 81bd417688 |
hex | 48ad04acf7 |
312140410103 has 4 divisors (see below), whose sum is σ = 328568852760. Its totient is φ = 295711967448.
The previous prime is 312140410067. The next prime is 312140410111. The reversal of 312140410103 is 301014041213.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 301014041213 = 17981 ⋅16740673.
It is a cyclic number.
It is not a de Polignac number, because 312140410103 - 210 = 312140409079 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (312140410133) 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, 8214221300 + ... + 8214221337.
It is an arithmetic number, because the mean of its divisors is an integer number (82142213190).
Almost surely, 2312140410103 is an apocalyptic number.
312140410103 is a deficient number, since it is larger than the sum of its proper divisors (16428442657).
312140410103 is a wasteful number, since it uses less digits than its factorization.
312140410103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16428442656.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 312140410103 its reverse (301014041213), we get a palindrome (613154451316).
The spelling of 312140410103 in words is "three hundred twelve billion, one hundred forty million, four hundred ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •