Base | Representation |
---|---|
bin | 11101101100010110101… |
… | …10011000101101000101 |
3 | 10121112102122020122001011 |
4 | 32312023112120231011 |
5 | 113203430224304113 |
6 | 2100405534202221 |
7 | 133465424456350 |
oct | 16661326305505 |
9 | 3545378218034 |
10 | 1020245150533 |
11 | 363757876164 |
12 | 145892053371 |
13 | 752936a875b |
14 | 37547105297 |
15 | 1b813ca963d |
hex | ed8b598b45 |
1020245150533 has 16 divisors (see below), whose sum is σ = 1186147440000. Its totient is φ = 859390866432.
The previous prime is 1020245150527. The next prime is 1020245150539. The reversal of 1020245150533 is 3350515420201.
It is an interprime number because it is at equal distance from previous prime (1020245150527) and next prime (1020245150539).
It is not a de Polignac number, because 1020245150533 - 213 = 1020245142341 is a prime.
It is a super-2 number, since 2×10202451505332 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1020245150495 and 1020245150504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020245150539) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 854133 + ... + 1664341.
It is an arithmetic number, because the mean of its divisors is an integer number (74134215000).
Almost surely, 21020245150533 is an apocalyptic number.
It is an amenable number.
1020245150533 is a deficient number, since it is larger than the sum of its proper divisors (165902289467).
1020245150533 is an equidigital number, since it uses as much as digits as its factorization.
1020245150533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 813324.
The product of its (nonzero) digits is 18000, while the sum is 31.
The spelling of 1020245150533 in words is "one trillion, twenty billion, two hundred forty-five million, one hundred fifty thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •