Base | Representation |
---|---|
bin | 11110110000111111… |
… | …001000010010100001 |
3 | 10011021012111122222202 |
4 | 132300333020102201 |
5 | 1020123213010423 |
6 | 23101535342545 |
7 | 2246421205634 |
oct | 366077102241 |
9 | 104235448882 |
10 | 33034110113 |
11 | 13011991954 |
12 | 649b081a55 |
13 | 3165b60324 |
14 | 18553adc1b |
15 | cd51a9728 |
hex | 7b0fc84a1 |
33034110113 has 4 divisors (see below), whose sum is σ = 33255815700. Its totient is φ = 32812404528.
The previous prime is 33034110101. The next prime is 33034110143. The reversal of 33034110113 is 31101143033.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6994478689 + 26039631424 = 83633^2 + 161368^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-33034110113 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (33034110143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 110852570 + ... + 110852867.
It is an arithmetic number, because the mean of its divisors is an integer number (8313953925).
Almost surely, 233034110113 is an apocalyptic number.
It is an amenable number.
33034110113 is a deficient number, since it is larger than the sum of its proper divisors (221705587).
33034110113 is a wasteful number, since it uses less digits than its factorization.
33034110113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 221705586.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 33034110113 its reverse (31101143033), we get a palindrome (64135253146).
The spelling of 33034110113 in words is "thirty-three billion, thirty-four million, one hundred ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •