Base | Representation |
---|---|
bin | 1111000001111000100001… |
… | …01111000011101110110001 |
3 | 11100000112222002121111022122 |
4 | 13200330100233003232301 |
5 | 13312443002323123400 |
6 | 154142552452044025 |
7 | 6650534102530421 |
oct | 740742057035661 |
9 | 140015862544278 |
10 | 33050054114225 |
11 | a5924a3a30685 |
12 | 38593a4303615 |
13 | 15597b6ca7b05 |
14 | 8238b9c5c481 |
15 | 3c4a93a01685 |
hex | 1e0f10bc3bb1 |
33050054114225 has 12 divisors (see below), whose sum is σ = 40983048525276. Its totient is φ = 26439410114880.
The previous prime is 33050054114197. The next prime is 33050054114239. The reversal of 33050054114225 is 52241145005033.
It can be written as a sum of positive squares in 6 ways, for example, as 15069799776256 + 17980254337969 = 3881984^2 + 4240313^2 .
It is not a de Polignac number, because 33050054114225 - 28 = 33050054113969 is a prime.
It is a Duffinian number.
It is an unprimeable number.
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 in 11 ways as a sum of consecutive naturals, for example, 14763182 + ... + 16853831.
It is an arithmetic number, because the mean of its divisors is an integer number (3415254043773).
Almost surely, 233050054114225 is an apocalyptic number.
It is an amenable number.
33050054114225 is a deficient number, since it is larger than the sum of its proper divisors (7932994411051).
33050054114225 is a wasteful number, since it uses less digits than its factorization.
33050054114225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31658836 (or 31658831 counting only the distinct ones).
The product of its (nonzero) digits is 72000, while the sum is 35.
Adding to 33050054114225 its reverse (52241145005033), we get a palindrome (85291199119258).
The spelling of 33050054114225 in words is "thirty-three trillion, fifty billion, fifty-four million, one hundred fourteen thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •