Base | Representation |
---|---|
bin | 11101000110111… |
… | …101111011101001 |
3 | 1021000221112221021 |
4 | 131012331323221 |
5 | 2000010201201 |
6 | 120243212441 |
7 | 15050020000 |
oct | 3506757351 |
9 | 1230845837 |
10 | 488365801 |
11 | 230740500 |
12 | 117677121 |
13 | 7a240761 |
14 | 48c07c37 |
15 | 2cd1aea1 |
hex | 1d1bdee9 |
488365801 has 45 divisors (see below), whose sum is σ = 641874359. Its totient is φ = 371263200.
The previous prime is 488365793. The next prime is 488365819. The reversal of 488365801 is 108563884.
The square root of 488365801 is 22099.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 23532201 + 464833600 = 4851^2 + 21560^2 .
It is not a de Polignac number, because 488365801 - 23 = 488365793 is a prime.
It is not an unprimeable number, because it can be changed into a prime (488365841) by changing a digit.
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 44 ways as a sum of consecutive naturals, for example, 11911341 + ... + 11911381.
Almost surely, 2488365801 is an apocalyptic number.
488365801 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
488365801 is the 22099-th square number.
488365801 is the 11050-th centered octagonal number.
It is an amenable number.
488365801 is a deficient number, since it is larger than the sum of its proper divisors (153508558).
488365801 is an frugal number, since it uses more digits than its factorization.
488365801 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132 (or 59 counting only the distinct ones).
The product of its (nonzero) digits is 184320, while the sum is 43.
The cubic root of 488365801 is about 787.4961053305.
The spelling of 488365801 in words is "four hundred eighty-eight million, three hundred sixty-five thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •