Base | Representation |
---|---|
bin | 1101111110001010001… |
… | …01111111001101010001 |
3 | 1200220002101002200121101 |
4 | 12333011011333031101 |
5 | 30331114300113100 |
6 | 1004310411424401 |
7 | 46453016052034 |
oct | 6770505771521 |
9 | 1626071080541 |
10 | 480048051025 |
11 | 175650678974 |
12 | 79053155101 |
13 | 363646c83ca |
14 | 1933d48901b |
15 | c74920986a |
hex | 6fc517f351 |
480048051025 has 9 divisors (see below), whose sum is σ = 595263879003. Its totient is φ = 384035669400.
The previous prime is 480048051019. The next prime is 480048051053. The reversal of 480048051025 is 520150840084.
The square root of 480048051025 is 692855.
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., 172817298369 + 307230752656 = 415713^2 + 554284^2 .
It is not a de Polignac number, because 480048051025 - 29 = 480048050513 is a prime.
It is a super-2 number, since 2×4800480510252 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 3394990 + ... + 3533560.
Almost surely, 2480048051025 is an apocalyptic number.
480048051025 is the 692855-th square number.
480048051025 is the 346428-th centered octagonal number.
It is an amenable number.
480048051025 is a deficient number, since it is larger than the sum of its proper divisors (115215827978).
480048051025 is an frugal number, since it uses more digits than its factorization.
480048051025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 277152 (or 138576 counting only the distinct ones).
The product of its (nonzero) digits is 51200, while the sum is 37.
The spelling of 480048051025 in words is "four hundred eighty billion, forty-eight million, fifty-one thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •