Base | Representation |
---|---|
bin | 1001000101010101001… |
… | …11011011111100010101 |
3 | 1002211120210102022100002 |
4 | 10202222213123330111 |
5 | 20103140112010401 |
6 | 355213220301045 |
7 | 31356063110303 |
oct | 4425247337425 |
9 | 1084523368302 |
10 | 312100110101 |
11 | 1103a741509a |
12 | 505a1841785 |
13 | 2357a945080 |
14 | 1116a17d273 |
15 | 81b9b06a6b |
hex | 48aa9dbf15 |
312100110101 has 8 divisors (see below), whose sum is σ = 339082217880. Its totient is φ = 285542917632.
The previous prime is 312100110089. The next prime is 312100110103. The reversal of 312100110101 is 101011001213.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 56316036100 + 255784074001 = 237310^2 + 505751^2 .
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 312100110101 - 26 = 312100110037 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 (312100110103) 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, 106227296 + ... + 106230233.
It is an arithmetic number, because the mean of its divisors is an integer number (42385277235).
Almost surely, 2312100110101 is an apocalyptic number.
It is an amenable number.
312100110101 is a deficient number, since it is larger than the sum of its proper divisors (26982107779).
312100110101 is a wasteful number, since it uses less digits than its factorization.
312100110101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 212457655.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 312100110101 its reverse (101011001213), we get a palindrome (413111111314).
The spelling of 312100110101 in words is "three hundred twelve billion, one hundred million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •