Base | Representation |
---|---|
bin | 1001000111000001110… |
… | …11100000110001011111 |
3 | 1002220221022001201002122 |
4 | 10203200323200301133 |
5 | 20112021400424211 |
6 | 355443451213155 |
7 | 31420466340314 |
oct | 4434073406137 |
9 | 1086838051078 |
10 | 313011342431 |
11 | 110824819467 |
12 | 507b6a471bb |
13 | 236946721b8 |
14 | 112151c0d0b |
15 | 821eb016db |
hex | 48e0ee0c5f |
313011342431 has 2 divisors, whose sum is σ = 313011342432. Its totient is φ = 313011342430.
The previous prime is 313011342409. The next prime is 313011342437. The reversal of 313011342431 is 134243110313.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-313011342431 is a prime.
It is a super-2 number, since 2×3130113424312 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 313011342431.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (313011342437) 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 as a sum of consecutive naturals, namely, 156505671215 + 156505671216.
It is an arithmetic number, because the mean of its divisors is an integer number (156505671216).
Almost surely, 2313011342431 is an apocalyptic number.
313011342431 is a deficient number, since it is larger than the sum of its proper divisors (1).
313011342431 is an equidigital number, since it uses as much as digits as its factorization.
313011342431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 313011342431 its reverse (134243110313), we get a palindrome (447254452744).
The spelling of 313011342431 in words is "three hundred thirteen billion, eleven million, three hundred forty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.026 sec. • engine limits •