Base | Representation |
---|---|
bin | 11110000011001110001… |
… | …11001111100101100101 |
3 | 10122201010020111102221121 |
4 | 33001213013033211211 |
5 | 113404101124300031 |
6 | 2110200100013541 |
7 | 134411601032164 |
oct | 17014707174545 |
9 | 3581106442847 |
10 | 1032522103141 |
11 | 36898789a391 |
12 | 1481396912b1 |
13 | 7649c02b859 |
14 | 37d8d8173db |
15 | 1bcd19d5011 |
hex | f0671cf965 |
1032522103141 has 2 divisors, whose sum is σ = 1032522103142. Its totient is φ = 1032522103140.
The previous prime is 1032522103139. The next prime is 1032522103157. The reversal of 1032522103141 is 1413012252301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 906180244225 + 126341858916 = 951935^2 + 355446^2 .
It is a cyclic number.
It is not a de Polignac number, because 1032522103141 - 21 = 1032522103139 is a prime.
It is a super-2 number, since 2×10325221031412 (a number of 25 digits) contains 22 as substring.
Together with 1032522103139, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1032522103181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 516261051570 + 516261051571.
It is an arithmetic number, because the mean of its divisors is an integer number (516261051571).
Almost surely, 21032522103141 is an apocalyptic number.
It is an amenable number.
1032522103141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1032522103141 is an equidigital number, since it uses as much as digits as its factorization.
1032522103141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1440, while the sum is 25.
Adding to 1032522103141 its reverse (1413012252301), we get a palindrome (2445534355442).
The spelling of 1032522103141 in words is "one trillion, thirty-two billion, five hundred twenty-two million, one hundred three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •