Base | Representation |
---|---|
bin | 11110110110001010… |
… | …101000110111010010 |
3 | 10011111021000210121200 |
4 | 132312022220313102 |
5 | 1020312434410302 |
6 | 23114322132030 |
7 | 2251524652464 |
oct | 366612506722 |
9 | 104437023550 |
10 | 33121013202 |
11 | 13056a48492 |
12 | 65041b1016 |
13 | 317ab69784 |
14 | 1862b52134 |
15 | cdcb2381c |
hex | 7b62a8dd2 |
33121013202 has 12 divisors (see below), whose sum is σ = 71762195310. Its totient is φ = 11040337728.
The previous prime is 33121013183. The next prime is 33121013323. The reversal of 33121013202 is 20231012133.
33121013202 is a `hidden beast` number, since 331 + 2 + 10 + 1 + 320 + 2 = 666.
It can be written as a sum of positive squares in only one way, i.e., 17461243881 + 15659769321 = 132141^2 + 125139^2 .
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 1840056289 = 33121013202 / (3 + 3 + 1 + 2 + 1 + 0 + 1 + 3 + 2 + 0 + 2).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 920028127 + ... + 920028162.
Almost surely, 233121013202 is an apocalyptic number.
33121013202 is an abundant number, since it is smaller than the sum of its proper divisors (38641182108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
33121013202 is a wasteful number, since it uses less digits than its factorization.
33121013202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1840056297 (or 1840056294 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 33121013202 its reverse (20231012133), we get a palindrome (53352025335).
The spelling of 33121013202 in words is "thirty-three billion, one hundred twenty-one million, thirteen thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •