Base | Representation |
---|---|
bin | 10011100111000101… |
… | …11111101100110011 |
3 | 1000011202012121201000 |
4 | 21303202333230303 |
5 | 133030243110433 |
6 | 4500422013043 |
7 | 521622450000 |
oct | 116342775463 |
9 | 30152177630 |
10 | 10528488243 |
11 | 451306a059 |
12 | 2059b77183 |
13 | cba338400 |
14 | 71c4128a7 |
15 | 4194a2113 |
hex | 2738bfb33 |
10528488243 has 180 divisors, whose sum is σ = 20359796760. Its totient is φ = 5374343520.
The previous prime is 10528488169. The next prime is 10528488253. The reversal of 10528488243 is 34288482501.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
10528488243 is a `hidden beast` number, since 1 + 0 + 528 + 4 + 8 + 82 + 43 = 666.
It is not a de Polignac number, because 10528488243 - 210 = 10528487219 is a prime.
It is a super-2 number, since 2×105284882432 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10528488253) by changing a digit.
It is a polite number, since it can be written in 179 ways as a sum of consecutive naturals, for example, 339628638 + ... + 339628668.
It is an arithmetic number, because the mean of its divisors is an integer number (113109982).
Almost surely, 210528488243 is an apocalyptic number.
10528488243 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
10528488243 is a deficient number, since it is larger than the sum of its proper divisors (9831308517).
10528488243 is an frugal number, since it uses more digits than its factorization.
10528488243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125 (or 54 counting only the distinct ones).
The product of its (nonzero) digits is 491520, while the sum is 45.
The spelling of 10528488243 in words is "ten billion, five hundred twenty-eight million, four hundred eighty-eight thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •