Base | Representation |
---|---|
bin | 10010100010011… |
… | …010001101000001 |
3 | 210200012221200002 |
4 | 102202122031001 |
5 | 1114104310423 |
6 | 50510005345 |
7 | 10464354011 |
oct | 2242321501 |
9 | 720187602 |
10 | 311010113 |
11 | 14a614557 |
12 | 881a6855 |
13 | 4c58436b |
14 | 2d43bc41 |
15 | 1c486228 |
hex | 1289a341 |
311010113 has 8 divisors (see below), whose sum is σ = 314286720. Its totient is φ = 307747440.
The previous prime is 311010109. The next prime is 311010143.
It is a happy number.
311010113 is nontrivially palindromic in base 10.
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 311010113 - 22 = 311010109 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 311010094 and 311010103.
It is not an unprimeable number, because it can be changed into a prime (311010103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 44843 + ... + 51311.
It is an arithmetic number, because the mean of its divisors is an integer number (39285840).
Almost surely, 2311010113 is an apocalyptic number.
It is an amenable number.
311010113 is a deficient number, since it is larger than the sum of its proper divisors (3276607).
311010113 is a wasteful number, since it uses less digits than its factorization.
311010113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6967.
The product of its (nonzero) digits is 9, while the sum is 11.
The square root of 311010113 is about 17635.4788140271. The cubic root of 311010113 is about 677.5242389080.
Multiplying 311010113 by its sum of digits (11), we get a palindrome (3421111243).
The spelling of 311010113 in words is "three hundred eleven million, ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •