Base | Representation |
---|---|
bin | 11101001011010110111… |
… | …00101001100110101101 |
3 | 10112211201001011102002010 |
4 | 32211223130221212231 |
5 | 112411140143140100 |
6 | 2044320030151433 |
7 | 132300425562321 |
oct | 16455334514655 |
9 | 3484631142063 |
10 | 1002530052525 |
11 | 3571970958a1 |
12 | 142369352579 |
13 | 736cc4bab41 |
14 | 3674647b981 |
15 | 1b12892b750 |
hex | e96b7299ad |
1002530052525 has 48 divisors (see below), whose sum is σ = 1702927505664. Its totient is φ = 520044353280.
The previous prime is 1002530052523. The next prime is 1002530052529. The reversal of 1002530052525 is 5252500352001.
It is not a de Polignac number, because 1002530052525 - 21 = 1002530052523 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1002530052492 and 1002530052501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1002530052523) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 7809004 + ... + 7936346.
It is an arithmetic number, because the mean of its divisors is an integer number (35477656368).
Almost surely, 21002530052525 is an apocalyptic number.
1002530052525 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1002530052525 is a deficient number, since it is larger than the sum of its proper divisors (700397453139).
1002530052525 is a wasteful number, since it uses less digits than its factorization.
1002530052525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130230 (or 130225 counting only the distinct ones).
The product of its (nonzero) digits is 15000, while the sum is 30.
The spelling of 1002530052525 in words is "one trillion, two billion, five hundred thirty million, fifty-two thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •