Base | Representation |
---|---|
bin | 1001000111001101110… |
… | …11111000100110000101 |
3 | 1002221012022122220000201 |
4 | 10203212323320212011 |
5 | 20112223144301201 |
6 | 355501451010501 |
7 | 31423131651634 |
oct | 4434673704605 |
9 | 1087168586021 |
10 | 313112103301 |
11 | 11087668a608 |
12 | 50824739a31 |
13 | 236ac4c110a |
14 | 1122472d51b |
15 | 82288a6801 |
hex | 48e6ef8985 |
313112103301 has 4 divisors (see below), whose sum is σ = 313208419104. Its totient is φ = 313015787500.
The previous prime is 313112103281. The next prime is 313112103373. The reversal of 313112103301 is 103301211313.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 103301211313 = 5147 ⋅20070179.
It is a cyclic number.
It is not a de Polignac number, because 313112103301 - 27 = 313112103173 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 (313112103401) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 48153025 + ... + 48159526.
It is an arithmetic number, because the mean of its divisors is an integer number (78302104776).
Almost surely, 2313112103301 is an apocalyptic number.
It is an amenable number.
313112103301 is a deficient number, since it is larger than the sum of its proper divisors (96315803).
313112103301 is an equidigital number, since it uses as much as digits as its factorization.
313112103301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 96315802.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 313112103301 its reverse (103301211313), we get a palindrome (416413314614).
The spelling of 313112103301 in words is "three hundred thirteen billion, one hundred twelve million, one hundred three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •