Base | Representation |
---|---|
bin | 1111000100010011100110… |
… | …01011100001010000101001 |
3 | 11100022111212100110211221011 |
4 | 13202021303023201100221 |
5 | 13320324004342333001 |
6 | 154245122121143521 |
7 | 6656542212105226 |
oct | 742116313412051 |
9 | 140274770424834 |
10 | 33133310121001 |
11 | a614837863852 |
12 | 387155a62aba1 |
13 | 15645c485a94c |
14 | 82793720094d |
15 | 3c6d17c82d51 |
hex | 1e22732e1429 |
33133310121001 has 2 divisors, whose sum is σ = 33133310121002. Its totient is φ = 33133310121000.
The previous prime is 33133310120951. The next prime is 33133310121029. The reversal of 33133310121001 is 10012101333133.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 33119437992601 + 13872128400 = 5754949^2 + 117780^2 .
It is a cyclic number.
It is not a de Polignac number, because 33133310121001 - 225 = 33133276566569 is a prime.
It is a super-2 number, since 2×331333101210012 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (33133310121101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16566655060500 + 16566655060501.
It is an arithmetic number, because the mean of its divisors is an integer number (16566655060501).
Almost surely, 233133310121001 is an apocalyptic number.
It is an amenable number.
33133310121001 is a deficient number, since it is larger than the sum of its proper divisors (1).
33133310121001 is an equidigital number, since it uses as much as digits as its factorization.
33133310121001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 33133310121001 its reverse (10012101333133), we get a palindrome (43145411454134).
The spelling of 33133310121001 in words is "thirty-three trillion, one hundred thirty-three billion, three hundred ten million, one hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •