Base | Representation |
---|---|
bin | 1001000111100100011… |
… | …01010110011000011011 |
3 | 1002221200111112120122011 |
4 | 10203302031112120123 |
5 | 20113120103344011 |
6 | 355532324410351 |
7 | 31430616345010 |
oct | 4436215263033 |
9 | 1087614476564 |
10 | 313301231131 |
11 | 1109634170a9 |
12 | 50877b469b7 |
13 | 2370c73c885 |
14 | 112418c1707 |
15 | 823a2b4621 |
hex | 48f235661b |
313301231131 has 8 divisors (see below), whose sum is σ = 358190842880. Its totient is φ = 268444692648.
The previous prime is 313301231129. The next prime is 313301231143. The reversal of 313301231131 is 131132103313.
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 313301231131 - 21 = 313301231129 is a prime.
It is a super-2 number, since 2×3133012311312 (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 (313301231161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8248011 + ... + 8285908.
It is an arithmetic number, because the mean of its divisors is an integer number (44773855360).
Almost surely, 2313301231131 is an apocalyptic number.
313301231131 is a deficient number, since it is larger than the sum of its proper divisors (44889611749).
313301231131 is a wasteful number, since it uses less digits than its factorization.
313301231131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16536633.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 313301231131 its reverse (131132103313), we get a palindrome (444433334444).
The spelling of 313301231131 in words is "three hundred thirteen billion, three hundred one million, two hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •