Base | Representation |
---|---|
bin | 1001000011101011001… |
… | …00010100010110010001 |
3 | 1002202021202201010011012 |
4 | 10201311210110112101 |
5 | 20044324241200423 |
6 | 354545024300305 |
7 | 31325035130063 |
oct | 4416544242621 |
9 | 1082252633135 |
10 | 311210100113 |
11 | 10aa8aa96450 |
12 | 50393771695 |
13 | 23468438843 |
14 | 110c3ca3733 |
15 | 8166900078 |
hex | 4875914591 |
311210100113 has 4 divisors (see below), whose sum is σ = 339501927408. Its totient is φ = 282918272820.
The previous prime is 311210100053. The next prime is 311210100133. The reversal of 311210100113 is 311001012113.
It is a happy number.
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.
It is a cyclic number.
It is not a de Polignac number, because 311210100113 - 26 = 311210100049 is a prime.
It is a super-2 number, since 2×3112101001132 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (311210100133) 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, 14145913631 + ... + 14145913652.
It is an arithmetic number, because the mean of its divisors is an integer number (84875481852).
Almost surely, 2311210100113 is an apocalyptic number.
It is an amenable number.
311210100113 is a deficient number, since it is larger than the sum of its proper divisors (28291827295).
311210100113 is a wasteful number, since it uses less digits than its factorization.
311210100113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28291827294.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 311210100113 its reverse (311001012113), we get a palindrome (622211112226).
The spelling of 311210100113 in words is "three hundred eleven billion, two hundred ten million, one hundred thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •