Base | Representation |
---|---|
bin | 11101101100111000000… |
… | …10000011101010111001 |
3 | 10121120011010220012012202 |
4 | 32312130002003222321 |
5 | 113210013402043134 |
6 | 2100453413115545 |
7 | 133505363443544 |
oct | 16663402035271 |
9 | 3546133805182 |
10 | 1020525034169 |
11 | 36389085a953 |
12 | 14594b928bb5 |
13 | 75309682184 |
14 | 3757235d85b |
15 | 1b82d642d7e |
hex | ed9c083ab9 |
1020525034169 has 2 divisors, whose sum is σ = 1020525034170. Its totient is φ = 1020525034168.
The previous prime is 1020525034129. The next prime is 1020525034181. The reversal of 1020525034169 is 9614305250201.
1020525034169 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 998976262144 + 21548772025 = 999488^2 + 146795^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1020525034169 is a prime.
It is a super-2 number, since 2×10205250341692 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1020525034129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 510262517084 + 510262517085.
It is an arithmetic number, because the mean of its divisors is an integer number (510262517085).
Almost surely, 21020525034169 is an apocalyptic number.
It is an amenable number.
1020525034169 is a deficient number, since it is larger than the sum of its proper divisors (1).
1020525034169 is an equidigital number, since it uses as much as digits as its factorization.
1020525034169 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64800, while the sum is 38.
The spelling of 1020525034169 in words is "one trillion, twenty billion, five hundred twenty-five million, thirty-four thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •