Base | Representation |
---|---|
bin | 11010100100100100… |
… | …100011001100000001 |
3 | 2201122100211021102002 |
4 | 122210210203030001 |
5 | 431412344123023 |
6 | 21035031033345 |
7 | 2030010132236 |
oct | 324444431401 |
9 | 81570737362 |
10 | 28530848513 |
11 | 11110a13852 |
12 | 5642b0b855 |
13 | 28c8bb40ab |
14 | 154929578d |
15 | b1eb74b28 |
hex | 6a4923301 |
28530848513 has 4 divisors (see below), whose sum is σ = 28556392020. Its totient is φ = 28505305008.
The previous prime is 28530848501. The next prime is 28530848531. The reversal of 28530848513 is 31584803582.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 13837287424 + 14693561089 = 117632^2 + 121217^2 .
It is a cyclic number.
It is not a de Polignac number, because 28530848513 - 212 = 28530844417 is a prime.
It is a super-2 number, since 2×285308485132 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (28530848573) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12770078 + ... + 12772311.
It is an arithmetic number, because the mean of its divisors is an integer number (7139098005).
Almost surely, 228530848513 is an apocalyptic number.
It is an amenable number.
28530848513 is a deficient number, since it is larger than the sum of its proper divisors (25543507).
28530848513 is a wasteful number, since it uses less digits than its factorization.
28530848513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25543506.
The product of its (nonzero) digits is 921600, while the sum is 47.
The spelling of 28530848513 in words is "twenty-eight billion, five hundred thirty million, eight hundred forty-eight thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •