Base | Representation |
---|---|
bin | 1001001001100110100000… |
… | …10010000010001101011001 |
3 | 2122020120010112101010120110 |
4 | 10210303100102002031121 |
5 | 10114131024011444113 |
6 | 110443303201514533 |
7 | 4144463066166534 |
oct | 444632022021531 |
9 | 78216115333513 |
10 | 20121121203033 |
11 | 64583573a9634 |
12 | 230b736942a49 |
13 | b2c54b863946 |
14 | 4d7c20461a1b |
15 | 24d5e34aebc3 |
hex | 124cd0482359 |
20121121203033 has 16 divisors (see below), whose sum is σ = 28244182630400. Its totient is φ = 12706270914960.
The previous prime is 20121121202989. The next prime is 20121121203083. The reversal of 20121121203033 is 33030212112102.
It is not a de Polignac number, because 20121121203033 - 225 = 20121087648601 is a prime.
It is a super-2 number, since 2×201211212030332 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20121121203083) 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 15 ways as a sum of consecutive naturals, for example, 24673513 + ... + 25475958.
It is an arithmetic number, because the mean of its divisors is an integer number (1765261414400).
Almost surely, 220121121203033 is an apocalyptic number.
It is an amenable number.
20121121203033 is a deficient number, since it is larger than the sum of its proper divisors (8123061427367).
20121121203033 is a wasteful number, since it uses less digits than its factorization.
20121121203033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50156532.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 20121121203033 its reverse (33030212112102), we get a palindrome (53151333315135).
The spelling of 20121121203033 in words is "twenty trillion, one hundred twenty-one billion, one hundred twenty-one million, two hundred three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •