Base | Representation |
---|---|
bin | 1001000111001110000… |
… | …00011111100001010001 |
3 | 1002221012101221021002220 |
4 | 10203213000133201101 |
5 | 20112224001430223 |
6 | 355501532531253 |
7 | 31423145142555 |
oct | 4434700374121 |
9 | 1087171837086 |
10 | 313113311313 |
11 | 110877335170 |
12 | 50825020b29 |
13 | 236ac824c0a |
14 | 11224965865 |
15 | 8228a446e3 |
hex | 48e701f851 |
313113311313 has 32 divisors (see below), whose sum is σ = 476322232320. Its totient is φ = 181101296640.
The previous prime is 313113311311. The next prime is 313113311327.
313113311313 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 313113311313 - 21 = 313113311311 is a prime.
It is a nude number because it is divisible by every one of its digits.
It is not an unprimeable number, because it can be changed into a prime (313113311311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 136656 + ... + 803057.
It is an arithmetic number, because the mean of its divisors is an integer number (14885069760).
Almost surely, 2313113311313 is an apocalyptic number.
313113311313 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
It is an amenable number.
313113311313 is a deficient number, since it is larger than the sum of its proper divisors (163208921007).
313113311313 is a wasteful number, since it uses less digits than its factorization.
313113311313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 940189.
The product of its digits is 729, while the sum is 24.
It can be divided in two parts, 313113 and 311313, that added together give a palindrome (624426).
The spelling of 313113311313 in words is "three hundred thirteen billion, one hundred thirteen million, three hundred eleven thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •