Base | Representation |
---|---|
bin | 10010101101111010… |
… | …00000110111110101 |
3 | 221221022112101100002 |
4 | 21112331000313311 |
5 | 131034441111100 |
6 | 4341044001045 |
7 | 504006063104 |
oct | 112675006765 |
9 | 27838471302 |
10 | 10048769525 |
11 | 42972a5303 |
12 | 1b45390185 |
13 | c41b34792 |
14 | 6b481a03b |
15 | 3dc2e32d5 |
hex | 256f40df5 |
10048769525 has 12 divisors (see below), whose sum is σ = 12695579172. Its totient is φ = 7887335040.
The previous prime is 10048769509. The next prime is 10048769527. The reversal of 10048769525 is 52596784001.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 66161956 + 9982607569 = 8134^2 + 99913^2 .
It is not a de Polignac number, because 10048769525 - 24 = 10048769509 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10048769525.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10048769527) 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 11 ways as a sum of consecutive naturals, for example, 3790664 + ... + 3793313.
It is an arithmetic number, because the mean of its divisors is an integer number (1057964931).
Almost surely, 210048769525 is an apocalyptic number.
It is an amenable number.
10048769525 is a deficient number, since it is larger than the sum of its proper divisors (2646809647).
10048769525 is an equidigital number, since it uses as much as digits as its factorization.
10048769525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7584040 (or 7584035 counting only the distinct ones).
The product of its (nonzero) digits is 604800, while the sum is 47.
The spelling of 10048769525 in words is "ten billion, forty-eight million, seven hundred sixty-nine thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •