Base | Representation |
---|---|
bin | 1110011010000011000… |
… | …01101101011011110001 |
3 | 1202022201211120201121111 |
4 | 13031001201231123301 |
5 | 31102300233014204 |
6 | 1015224225153321 |
7 | 50523033426400 |
oct | 7150141553361 |
9 | 1668654521544 |
10 | 495020594929 |
11 | 180a342477a3 |
12 | 7bb3148b841 |
13 | 378ac650343 |
14 | 19d5dba3637 |
15 | cd238e8d04 |
hex | 734186d6f1 |
495020594929 has 9 divisors (see below), whose sum is σ = 575846013081. Its totient is φ = 424299145620.
The previous prime is 495020594869. The next prime is 495020594941. The reversal of 495020594929 is 929495020594.
The square root of 495020594929 is 703577.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 495020594929 - 213 = 495020586737 is a prime.
It is a super-2 number, since 2×4950205949292 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (495020594969) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 4874784 + ... + 4975294.
Almost surely, 2495020594929 is an apocalyptic number.
495020594929 is a gapful number since it is divisible by the number (49) formed by its first and last digit.
495020594929 is the 703577-th square number.
495020594929 is the 351789-th centered octagonal number.
It is an amenable number.
495020594929 is a deficient number, since it is larger than the sum of its proper divisors (80825418152).
495020594929 is an frugal number, since it uses more digits than its factorization.
495020594929 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 201036 (or 100518 counting only the distinct ones).
The product of its (nonzero) digits is 10497600, while the sum is 58.
The spelling of 495020594929 in words is "four hundred ninety-five billion, twenty million, five hundred ninety-four thousand, nine hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •