Base | Representation |
---|---|
bin | 10010101111010100… |
… | …010101010110101101 |
3 | 1220221021121111022102 |
4 | 102233110111112231 |
5 | 312202012243313 |
6 | 13124335224445 |
7 | 1311423324425 |
oct | 225724252655 |
9 | 56837544272 |
10 | 20121212333 |
11 | 8595999702 |
12 | 3a96678125 |
13 | 1b88837601 |
14 | d8c439485 |
15 | 7cb710a58 |
hex | 4af5155ad |
20121212333 has 4 divisors (see below), whose sum is σ = 20121625020. Its totient is φ = 20120799648.
The previous prime is 20121212329. The next prime is 20121212341. The reversal of 20121212333 is 33321212102.
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 7370737609 + 12750474724 = 85853^2 + 112918^2 .
It is a cyclic number.
It is not a de Polignac number, because 20121212333 - 22 = 20121212329 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20121212533) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 121610 + ... + 234587.
It is an arithmetic number, because the mean of its divisors is an integer number (5030406255).
Almost surely, 220121212333 is an apocalyptic number.
It is an amenable number.
20121212333 is a deficient number, since it is larger than the sum of its proper divisors (412687).
20121212333 is an equidigital number, since it uses as much as digits as its factorization.
20121212333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 412686.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 20121212333 its reverse (33321212102), we get a palindrome (53442424435).
The spelling of 20121212333 in words is "twenty billion, one hundred twenty-one million, two hundred twelve thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •