Base | Representation |
---|---|
bin | 11110101111110010… |
… | …111101110001100101 |
3 | 10011012210221021202211 |
4 | 132233302331301211 |
5 | 1020103110102401 |
6 | 23055543403421 |
7 | 2246056410661 |
oct | 365762756145 |
9 | 104183837684 |
10 | 33014144101 |
11 | 13001695114 |
12 | 6494453571 |
13 | 316198c513 |
14 | 18528938a1 |
15 | cd3563951 |
hex | 7afcbdc65 |
33014144101 has 2 divisors, whose sum is σ = 33014144102. Its totient is φ = 33014144100.
The previous prime is 33014144039. The next prime is 33014144123. The reversal of 33014144101 is 10144141033.
It is a happy number.
It is an a-pointer prime, because the next prime (33014144123) can be obtained adding 33014144101 to its sum of digits (22).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29885419876 + 3128724225 = 172874^2 + 55935^2 .
It is a cyclic number.
It is not a de Polignac number, because 33014144101 - 213 = 33014135909 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (33014144131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16507072050 + 16507072051.
It is an arithmetic number, because the mean of its divisors is an integer number (16507072051).
Almost surely, 233014144101 is an apocalyptic number.
It is an amenable number.
33014144101 is a deficient number, since it is larger than the sum of its proper divisors (1).
33014144101 is an equidigital number, since it uses as much as digits as its factorization.
33014144101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 33014144101 its reverse (10144141033), we get a palindrome (43158285134).
The spelling of 33014144101 in words is "thirty-three billion, fourteen million, one hundred forty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •