Base | Representation |
---|---|
bin | 10000001001111010100100… |
… | …00111000111010111010111 |
3 | 11122210011100221222020121021 |
4 | 20010331102013013113113 |
5 | 14124020301314231403 |
6 | 203315552244302011 |
7 | 10324412623363414 |
oct | 1004752207072727 |
9 | 148704327866537 |
10 | 35525052102103 |
11 | 103570a9859123 |
12 | 3b98bb00a1907 |
13 | 16a8cc88ca925 |
14 | 8ab5c91c310b |
15 | 41914c6938bd |
hex | 204f521c75d7 |
35525052102103 has 2 divisors, whose sum is σ = 35525052102104. Its totient is φ = 35525052102102.
The previous prime is 35525052102047. The next prime is 35525052102121. The reversal of 35525052102103 is 30120125052553.
35525052102103 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 is a cyclic number.
It is not a de Polignac number, because 35525052102103 - 213 = 35525052093911 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (35525052102193) 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 as a sum of consecutive naturals, namely, 17762526051051 + 17762526051052.
It is an arithmetic number, because the mean of its divisors is an integer number (17762526051052).
Almost surely, 235525052102103 is an apocalyptic number.
35525052102103 is a deficient number, since it is larger than the sum of its proper divisors (1).
35525052102103 is an equidigital number, since it uses as much as digits as its factorization.
35525052102103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45000, while the sum is 34.
Adding to 35525052102103 its reverse (30120125052553), we get a palindrome (65645177154656).
The spelling of 35525052102103 in words is "thirty-five trillion, five hundred twenty-five billion, fifty-two million, one hundred two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •