Base | Representation |
---|---|
bin | 1111010111100101000… |
… | …01111110111101111011 |
3 | 1212111000001122122010200 |
4 | 13223302201332331323 |
5 | 32122424040130201 |
6 | 1042330215213243 |
7 | 53102460325110 |
oct | 7536241767573 |
9 | 1774001578120 |
10 | 528055005051 |
11 | 193a46313a92 |
12 | 86410677223 |
13 | 3aa45587092 |
14 | 1b7b5210907 |
15 | db08b12386 |
hex | 7af287ef7b |
528055005051 has 96 divisors (see below), whose sum is σ = 905158066176. Its totient is φ = 290287800000.
The previous prime is 528055005043. The next prime is 528055005059. The reversal of 528055005051 is 150500550825.
528055005051 is a `hidden beast` number, since 5 + 2 + 8 + 0 + 550 + 0 + 50 + 51 = 666.
It is an interprime number because it is at equal distance from previous prime (528055005043) and next prime (528055005059).
It is not a de Polignac number, because 528055005051 - 23 = 528055005043 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 528055004997 and 528055005015.
It is not an unprimeable number, because it can be changed into a prime (528055005059) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 485790630 + ... + 485791716.
It is an arithmetic number, because the mean of its divisors is an integer number (9428729856).
Almost surely, 2528055005051 is an apocalyptic number.
528055005051 is a deficient number, since it is larger than the sum of its proper divisors (377103061125).
528055005051 is a wasteful number, since it uses less digits than its factorization.
528055005051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2373 (or 2370 counting only the distinct ones).
The product of its (nonzero) digits is 50000, while the sum is 36.
Adding to 528055005051 its reverse (150500550825), we get a palindrome (678555555876).
The spelling of 528055005051 in words is "five hundred twenty-eight billion, fifty-five million, five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •