Base | Representation |
---|---|
bin | 11101101100001001001… |
… | …10110110001111101101 |
3 | 10121112010202101021102122 |
4 | 32312010212312033231 |
5 | 113203212244302300 |
6 | 2100350413402325 |
7 | 133462552100300 |
oct | 16660446661755 |
9 | 3545122337378 |
10 | 1020132025325 |
11 | 3636a9a2a556 |
12 | 1458601993a5 |
13 | 7527611aa6a |
14 | 37536098b37 |
15 | 1b808db0c85 |
hex | ed849b63ed |
1020132025325 has 72 divisors (see below), whose sum is σ = 1497394589184. Its totient is φ = 687231216000.
The previous prime is 1020132025307. The next prime is 1020132025333. The reversal of 1020132025325 is 5235202310201.
It is a happy number.
It is not a de Polignac number, because 1020132025325 - 218 = 1020131763181 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1020132025294 and 1020132025303.
It is a congruent number.
It is an unprimeable number.
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 71 ways as a sum of consecutive naturals, for example, 66273380 + ... + 66288770.
It is an arithmetic number, because the mean of its divisors is an integer number (20797147072).
Almost surely, 21020132025325 is an apocalyptic number.
It is an amenable number.
1020132025325 is a deficient number, since it is larger than the sum of its proper divisors (477262563859).
1020132025325 is a wasteful number, since it uses less digits than its factorization.
1020132025325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16363 (or 16351 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 26.
Adding to 1020132025325 its reverse (5235202310201), we get a palindrome (6255334335526).
The spelling of 1020132025325 in words is "one trillion, twenty billion, one hundred thirty-two million, twenty-five thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •