Base | Representation |
---|---|
bin | 1001001001101000100010… |
… | …10000000101101100000001 |
3 | 2122020122221111102022211011 |
4 | 10210310101100011230001 |
5 | 10114140242032241113 |
6 | 110444003300320521 |
7 | 4144532103131410 |
oct | 444642120055401 |
9 | 78218844368734 |
10 | 20122211212033 |
11 | 645886670a517 |
12 | 230b99b9a3141 |
13 | b2c693626b98 |
14 | 4d7cc511d477 |
15 | 24d65902063d |
hex | 124d11405b01 |
20122211212033 has 8 divisors (see below), whose sum is σ = 23084253168768. Its totient is φ = 17182029344064.
The previous prime is 20122211211967. The next prime is 20122211212043. The reversal of 20122211212033 is 33021211222102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20122211212033 - 233 = 20113621277441 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20122211211995 and 20122211212013.
It is not an unprimeable number, because it can be changed into a prime (20122211212043) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5465020216 + ... + 5465023897.
It is an arithmetic number, because the mean of its divisors is an integer number (2885531646096).
Almost surely, 220122211212033 is an apocalyptic number.
It is an amenable number.
20122211212033 is a deficient number, since it is larger than the sum of its proper divisors (2962041956735).
20122211212033 is a wasteful number, since it uses less digits than its factorization.
20122211212033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10930044383.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 20122211212033 its reverse (33021211222102), we get a palindrome (53143422434135).
The spelling of 20122211212033 in words is "twenty trillion, one hundred twenty-two billion, two hundred eleven million, two hundred twelve thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •