Base | Representation |
---|---|
bin | 1110011010010010101… |
… | …00111101000101100100 |
3 | 1202100001221211210221121 |
4 | 13031021110331011210 |
5 | 31103032234001100 |
6 | 1015245222223324 |
7 | 50526213020224 |
oct | 7151124750544 |
9 | 1670057753847 |
10 | 495151468900 |
11 | 180aa1106300 |
12 | 7bb69284b44 |
13 | 379007b386a |
14 | 19d73310084 |
15 | cd3014b51a |
hex | 734953d164 |
495151468900 has 81 divisors (see below), whose sum is σ = 1181223210027. Its totient is φ = 180026932800.
The previous prime is 495151468897. The next prime is 495151468937. The reversal of 495151468900 is 9864151594.
The square root of 495151468900 is 703670.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 273995714916 + 221155753984 = 523446^2 + 470272^2 .
It is a Duffinian number.
It is an unprimeable number.
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 in 26 ways as a sum of consecutive naturals, for example, 77400502 + ... + 77406898.
Almost surely, 2495151468900 is an apocalyptic number.
495151468900 is the 703670-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 495151468900
495151468900 is an abundant number, since it is smaller than the sum of its proper divisors (686071741127).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
495151468900 is an equidigital number, since it uses as much as digits as its factorization.
495151468900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12830 (or 6415 counting only the distinct ones).
The product of its (nonzero) digits is 1555200, while the sum is 52.
The spelling of 495151468900 in words is "four hundred ninety-five billion, one hundred fifty-one million, four hundred sixty-eight thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •