Base | Representation |
---|---|
bin | 1111000000101111110100… |
… | …01011100011000110010101 |
3 | 11022212211012210220220021111 |
4 | 13200113322023203012111 |
5 | 13311323032334013414 |
6 | 154113015333015021 |
7 | 6644652605535004 |
oct | 740277213430625 |
9 | 138784183826244 |
10 | 33011021001109 |
11 | a57799383a008 |
12 | 3851910184471 |
13 | 1555c0633a788 |
14 | 821a55c5cc3b |
15 | 3c3a5bd598c4 |
hex | 1e05fa2e3195 |
33011021001109 has 2 divisors, whose sum is σ = 33011021001110. Its totient is φ = 33011021001108.
The previous prime is 33011021001097. The next prime is 33011021001143. The reversal of 33011021001109 is 90110012011033.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 28837490703025 + 4173530298084 = 5370055^2 + 2042922^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-33011021001109 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 33011021001109.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (33011021002109) 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, 16505510500554 + 16505510500555.
It is an arithmetic number, because the mean of its divisors is an integer number (16505510500555).
Almost surely, 233011021001109 is an apocalyptic number.
It is an amenable number.
33011021001109 is a deficient number, since it is larger than the sum of its proper divisors (1).
33011021001109 is an equidigital number, since it uses as much as digits as its factorization.
33011021001109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 22.
The spelling of 33011021001109 in words is "thirty-three trillion, eleven billion, twenty-one million, one thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •