Base | Representation |
---|---|
bin | 1111000001000001001000… |
… | …00010001101010100000001 |
3 | 11022220201012101200222010022 |
4 | 13200200210002031110001 |
5 | 13312001100130131431 |
6 | 154121153351343225 |
7 | 6645432066404333 |
oct | 740404402152401 |
9 | 138821171628108 |
10 | 33020313130241 |
11 | a580921a19178 |
12 | 3853684081b15 |
13 | 1556a57491138 |
14 | 822297d99453 |
15 | 3c3e029dd07b |
hex | 1e082408d501 |
33020313130241 has 2 divisors, whose sum is σ = 33020313130242. Its totient is φ = 33020313130240.
The previous prime is 33020313130159. The next prime is 33020313130253. The reversal of 33020313130241 is 14203131302033.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17062517262400 + 15957795867841 = 4130680^2 + 3994721^2 .
It is a cyclic number.
It is not a de Polignac number, because 33020313130241 - 242 = 28622266619137 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 33020313130241.
It is not a weakly prime, because it can be changed into another prime (33020313130261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16510156565120 + 16510156565121.
It is an arithmetic number, because the mean of its divisors is an integer number (16510156565121).
Almost surely, 233020313130241 is an apocalyptic number.
It is an amenable number.
33020313130241 is a deficient number, since it is larger than the sum of its proper divisors (1).
33020313130241 is an equidigital number, since it uses as much as digits as its factorization.
33020313130241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 33020313130241 its reverse (14203131302033), we get a palindrome (47223444432274).
The spelling of 33020313130241 in words is "thirty-three trillion, twenty billion, three hundred thirteen million, one hundred thirty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •