Base | Representation |
---|---|
bin | 11111000110111000… |
… | …101000010101011001 |
3 | 10012012210211021011222 |
4 | 133012320220111121 |
5 | 1021401241130423 |
6 | 23202222101425 |
7 | 2261502052244 |
oct | 370670502531 |
9 | 105183737158 |
10 | 33401505113 |
11 | 13190308189 |
12 | 658211a875 |
13 | 31c3cc7012 |
14 | 188c0c825b |
15 | d0757c3c8 |
hex | 7c6e28559 |
33401505113 has 2 divisors, whose sum is σ = 33401505114. Its totient is φ = 33401505112.
The previous prime is 33401505101. The next prime is 33401505161. The reversal of 33401505113 is 31150510433.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 32168933449 + 1232571664 = 179357^2 + 35108^2 .
It is a cyclic number.
It is not a de Polignac number, because 33401505113 - 222 = 33397310809 is a prime.
It is a super-2 number, since 2×334015051132 (a number of 22 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (33401505173) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16700752556 + 16700752557.
It is an arithmetic number, because the mean of its divisors is an integer number (16700752557).
Almost surely, 233401505113 is an apocalyptic number.
It is an amenable number.
33401505113 is a deficient number, since it is larger than the sum of its proper divisors (1).
33401505113 is an equidigital number, since it uses as much as digits as its factorization.
33401505113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2700, while the sum is 26.
The spelling of 33401505113 in words is "thirty-three billion, four hundred one million, five hundred five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •