Base | Representation |
---|---|
bin | 11110110010001111… |
… | …000001001010011001 |
3 | 10011022122220122110112 |
4 | 132302033001022121 |
5 | 1020144043134231 |
6 | 23104004254105 |
7 | 2250064211165 |
oct | 366217011231 |
9 | 104278818415 |
10 | 33055052441 |
11 | 13022796164 |
12 | 64a60a1335 |
13 | 316a2b3638 |
14 | 18580a1ca5 |
15 | cd6e4492b |
hex | 7b23c1299 |
33055052441 has 4 divisors (see below), whose sum is σ = 33060184500. Its totient is φ = 33049920384.
The previous prime is 33055052423. The next prime is 33055052453. The reversal of 33055052441 is 14425055033.
It is a happy number.
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 16816902400 + 16238150041 = 129680^2 + 127429^2 .
It is a cyclic number.
It is not a de Polignac number, because 33055052441 - 210 = 33055051417 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 33055052398 and 33055052407.
It is not an unprimeable number, because it can be changed into a prime (33055052411) 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, 2556356 + ... + 2569253.
It is an arithmetic number, because the mean of its divisors is an integer number (8265046125).
Almost surely, 233055052441 is an apocalyptic number.
It is an amenable number.
33055052441 is a deficient number, since it is larger than the sum of its proper divisors (5132059).
33055052441 is an equidigital number, since it uses as much as digits as its factorization.
33055052441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5132058.
The product of its (nonzero) digits is 36000, while the sum is 32.
The spelling of 33055052441 in words is "thirty-three billion, fifty-five million, fifty-two thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •