Base | Representation |
---|---|
bin | 1111000100100111111100… |
… | …00100110100000000100001 |
3 | 11100100120001101202222001011 |
4 | 13202103332010310000201 |
5 | 13321013340431033101 |
6 | 154254125455140521 |
7 | 6660406632256351 |
oct | 742237604640041 |
9 | 140316041688034 |
10 | 33144230330401 |
11 | a619430a537a3 |
12 | 38736a7814741 |
13 | 1565645099308 |
14 | 828291660b61 |
15 | 3c7256810751 |
hex | 1e24fe134021 |
33144230330401 has 2 divisors, whose sum is σ = 33144230330402. Its totient is φ = 33144230330400.
The previous prime is 33144230330363. The next prime is 33144230330413. The reversal of 33144230330401 is 10403303244133.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20431982030625 + 12712248299776 = 4520175^2 + 3565424^2 .
It is a cyclic number.
It is not a de Polignac number, because 33144230330401 - 27 = 33144230330273 is a prime.
It is not a weakly prime, because it can be changed into another prime (33144230330501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16572115165200 + 16572115165201.
It is an arithmetic number, because the mean of its divisors is an integer number (16572115165201).
Almost surely, 233144230330401 is an apocalyptic number.
It is an amenable number.
33144230330401 is a deficient number, since it is larger than the sum of its proper divisors (1).
33144230330401 is an equidigital number, since it uses as much as digits as its factorization.
33144230330401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31104, while the sum is 31.
Adding to 33144230330401 its reverse (10403303244133), we get a palindrome (43547533574534).
The spelling of 33144230330401 in words is "thirty-three trillion, one hundred forty-four billion, two hundred thirty million, three hundred thirty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •