Base | Representation |
---|---|
bin | 1110011010001111100… |
… | …00111000101101000110 |
3 | 1202100000010111001221002 |
4 | 13031013300320231012 |
5 | 31103004030032200 |
6 | 1015242444053302 |
7 | 50525444033120 |
oct | 7150760705506 |
9 | 1670003431832 |
10 | 495125236550 |
11 | 180a8831957a |
12 | 7bb60534232 |
13 | 378c822a769 |
14 | 19d6da42210 |
15 | cd2cbb8bd5 |
hex | 7347c38b46 |
495125236550 has 48 divisors (see below), whose sum is σ = 1080940621920. Its totient is φ = 165169186560.
The previous prime is 495125236549. The next prime is 495125236579. The reversal of 495125236550 is 55632521594.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 495125236495 and 495125236504.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 19103855 + ... + 19129754.
It is an arithmetic number, because the mean of its divisors is an integer number (22519596290).
Almost surely, 2495125236550 is an apocalyptic number.
495125236550 is an abundant number, since it is smaller than the sum of its proper divisors (585815385370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
495125236550 is a wasteful number, since it uses less digits than its factorization.
495125236550 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38233665 (or 38233660 counting only the distinct ones).
The product of its (nonzero) digits is 1620000, while the sum is 47.
The spelling of 495125236550 in words is "four hundred ninety-five billion, one hundred twenty-five million, two hundred thirty-six thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •