Base | Representation |
---|---|
bin | 11110000100010110111… |
… | …10010100010000001101 |
3 | 10122202200202101002022122 |
4 | 33002023132110100031 |
5 | 113411323311200331 |
6 | 2110340411022325 |
7 | 134432656136102 |
oct | 17021336242015 |
9 | 3582622332278 |
10 | 1033132131341 |
11 | 369170177622 |
12 | 148289a3a9a5 |
13 | 76568528a9b |
14 | 3800a850aa9 |
15 | 1bd1a33417b |
hex | f08b79440d |
1033132131341 has 2 divisors, whose sum is σ = 1033132131342. Its totient is φ = 1033132131340.
The previous prime is 1033132131329. The next prime is 1033132131359. The reversal of 1033132131341 is 1431312313301.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1017899388100 + 15232743241 = 1008910^2 + 123421^2 .
It is a cyclic number.
It is not a de Polignac number, because 1033132131341 - 218 = 1033131869197 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1033132131341.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1033132131371) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 516566065670 + 516566065671.
It is an arithmetic number, because the mean of its divisors is an integer number (516566065671).
Almost surely, 21033132131341 is an apocalyptic number.
It is an amenable number.
1033132131341 is a deficient number, since it is larger than the sum of its proper divisors (1).
1033132131341 is an equidigital number, since it uses as much as digits as its factorization.
1033132131341 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944, while the sum is 26.
Adding to 1033132131341 its reverse (1431312313301), we get a palindrome (2464444444642).
The spelling of 1033132131341 in words is "one trillion, thirty-three billion, one hundred thirty-two million, one hundred thirty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •