Base | Representation |
---|---|
bin | 100011101100101001110000… |
… | …0010010011101010110000111 |
3 | 1112011210010111001102221001221 |
4 | 1013121103200102131112013 |
5 | 312124034433343324033 |
6 | 3031453414252101211 |
7 | 123065524316201026 |
oct | 10731234022352607 |
9 | 1464703431387057 |
10 | 314000232011143 |
11 | 91060829001557 |
12 | 2b273422464807 |
13 | 10629130440562 |
14 | 5777999a1a8bd |
15 | 2647ceecdb12d |
hex | 11d94e049d587 |
314000232011143 has 2 divisors, whose sum is σ = 314000232011144. Its totient is φ = 314000232011142.
The previous prime is 314000232011117. The next prime is 314000232011197. The reversal of 314000232011143 is 341110232000413.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 314000232011143 - 229 = 313999695140231 is a prime.
It is a super-2 number, since 2×3140002320111432 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (314000232011443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 157000116005571 + 157000116005572.
It is an arithmetic number, because the mean of its divisors is an integer number (157000116005572).
Almost surely, 2314000232011143 is an apocalyptic number.
314000232011143 is a deficient number, since it is larger than the sum of its proper divisors (1).
314000232011143 is an equidigital number, since it uses as much as digits as its factorization.
314000232011143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 314000232011143 its reverse (341110232000413), we get a palindrome (655110464011556).
The spelling of 314000232011143 in words is "three hundred fourteen trillion, two hundred thirty-two million, eleven thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •