Base | Representation |
---|---|
bin | 100011011110111001101100… |
… | …0001010001010110011110111 |
3 | 1111221002110021010202210221022 |
4 | 1012331303120022022303313 |
5 | 311402103403330310403 |
6 | 3023445255204411355 |
7 | 122512140303223433 |
oct | 10675633012126367 |
9 | 1457073233683838 |
10 | 312110310010103 |
11 | 904a226a335630 |
12 | 2b00909b3a6b5b |
13 | 1051cb505b5717 |
14 | 57103108559c3 |
15 | 2613a8abb1d38 |
hex | 11bdcd828acf7 |
312110310010103 has 16 divisors (see below), whose sum is σ = 352314862709760. Its totient is φ = 273882575416800.
The previous prime is 312110310010099. The next prime is 312110310010111. The reversal of 312110310010103 is 301010013011213.
It is a cyclic number.
It is not a de Polignac number, because 312110310010103 - 22 = 312110310010099 is a prime.
It is a super-2 number, since 2×3121103100101032 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (312110310010193) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 123835775 + ... + 126330992.
It is an arithmetic number, because the mean of its divisors is an integer number (22019678919360).
Almost surely, 2312110310010103 is an apocalyptic number.
312110310010103 is a deficient number, since it is larger than the sum of its proper divisors (40204552699657).
312110310010103 is a wasteful number, since it uses less digits than its factorization.
312110310010103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 250170718.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 312110310010103 its reverse (301010013011213), we get a palindrome (613120323021316).
The spelling of 312110310010103 in words is "three hundred twelve trillion, one hundred ten billion, three hundred ten million, ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •