Base | Representation |
---|---|
bin | 1001000111001110000… |
… | …11001010100111100011 |
3 | 1002221012110020212110010 |
4 | 10203213003022213203 |
5 | 20112224141342011 |
6 | 355501555540003 |
7 | 31423154122014 |
oct | 4434703124743 |
9 | 1087173225403 |
10 | 313114012131 |
11 | 110877773758 |
12 | 508252ba603 |
13 | 236aca0bbbb |
14 | 11224aa900b |
15 | 8228b321a6 |
hex | 48e70ca9e3 |
313114012131 has 16 divisors (see below), whose sum is σ = 439487312000. Its totient is φ = 197743146048.
The previous prime is 313114012121. The next prime is 313114012157. The reversal of 313114012131 is 131210411313.
It is not a de Polignac number, because 313114012131 - 218 = 313113749987 is a prime.
It is a super-2 number, since 2×3131140121312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 313114012098 and 313114012107.
It is not an unprimeable number, because it can be changed into a prime (313114012121) 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 15 ways as a sum of consecutive naturals, for example, 727920 + ... + 1075218.
It is an arithmetic number, because the mean of its divisors is an integer number (27467957000).
Almost surely, 2313114012131 is an apocalyptic number.
313114012131 is a deficient number, since it is larger than the sum of its proper divisors (126373299869).
313114012131 is a wasteful number, since it uses less digits than its factorization.
313114012131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 363138.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 313114012131 its reverse (131210411313), we get a palindrome (444324423444).
The spelling of 313114012131 in words is "three hundred thirteen billion, one hundred fourteen million, twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •