Base | Representation |
---|---|
bin | 1110011010010000001… |
… | …11011010100011011111 |
3 | 1202100000112121010012001 |
4 | 13031020013122203133 |
5 | 31103012033023432 |
6 | 1015243214423131 |
7 | 50525545161211 |
oct | 7151007324337 |
9 | 1670015533161 |
10 | 495131142367 |
11 | 180a90692714 |
12 | 7bb62501aa7 |
13 | 378c9517924 |
14 | 19d7073c5b1 |
15 | cd2d4839e7 |
hex | 73481da8df |
495131142367 has 2 divisors, whose sum is σ = 495131142368. Its totient is φ = 495131142366.
The previous prime is 495131142329. The next prime is 495131142413. The reversal of 495131142367 is 763241131594.
It is an a-pointer prime, because the next prime (495131142413) can be obtained adding 495131142367 to its sum of digits (46).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 495131142367 - 27 = 495131142239 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (495131742367) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 247565571183 + 247565571184.
It is an arithmetic number, because the mean of its divisors is an integer number (247565571184).
Almost surely, 2495131142367 is an apocalyptic number.
495131142367 is a deficient number, since it is larger than the sum of its proper divisors (1).
495131142367 is an equidigital number, since it uses as much as digits as its factorization.
495131142367 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 544320, while the sum is 46.
The spelling of 495131142367 in words is "four hundred ninety-five billion, one hundred thirty-one million, one hundred forty-two thousand, three hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •