Base | Representation |
---|---|
bin | 1001000111110000001… |
… | …10010001101111101111 |
3 | 1002221221101110121111212 |
4 | 10203320012101233233 |
5 | 20113320402243211 |
6 | 355550214305035 |
7 | 31433226250532 |
oct | 4437006215757 |
9 | 1087841417455 |
10 | 313400040431 |
11 | 110a04174a85 |
12 | 508a505817b |
13 | 2372705740a |
14 | 11250a82a19 |
15 | 8243cd138b |
hex | 48f8191bef |
313400040431 has 4 divisors (see below), whose sum is σ = 321870311832. Its totient is φ = 304929769032.
The previous prime is 313400040427. The next prime is 313400040433. The reversal of 313400040431 is 134040004313.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 313400040431 - 22 = 313400040427 is a prime.
It is a super-2 number, since 2×3134000404312 (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 = 313400040397 and 313400040406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (313400040433) 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, 4235135645 + ... + 4235135718.
It is an arithmetic number, because the mean of its divisors is an integer number (80467577958).
Almost surely, 2313400040431 is an apocalyptic number.
313400040431 is a deficient number, since it is larger than the sum of its proper divisors (8470271401).
313400040431 is an equidigital number, since it uses as much as digits as its factorization.
313400040431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8470271400.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 313400040431 its reverse (134040004313), we get a palindrome (447440044744).
The spelling of 313400040431 in words is "three hundred thirteen billion, four hundred million, forty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •