Base | Representation |
---|---|
bin | 1001001001101000001011… |
… | …10111011111000111110001 |
3 | 2122020122110012000120201112 |
4 | 10210310011313133013301 |
5 | 10114134344133310413 |
6 | 110443532314443105 |
7 | 4144524263513531 |
oct | 444640567370761 |
9 | 78218405016645 |
10 | 20122020213233 |
11 | 6458778915274 |
12 | 230b947a33495 |
13 | b2c662ba1943 |
14 | 4d7ca7a014c1 |
15 | 24d6473932a8 |
hex | 124d05ddf1f1 |
20122020213233 has 8 divisors (see below), whose sum is σ = 20569272255840. Its totient is φ = 19679089446720.
The previous prime is 20122020213199. The next prime is 20122020213283. The reversal of 20122020213233 is 33231202022102.
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 20122020213233 - 28 = 20122020212977 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20122020213199 and 20122020213208.
It is not an unprimeable number, because it can be changed into a prime (20122020213283) 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, 1080309608 + ... + 1080328233.
It is an arithmetic number, because the mean of its divisors is an integer number (2571159031980).
Almost surely, 220122020213233 is an apocalyptic number.
It is an amenable number.
20122020213233 is a deficient number, since it is larger than the sum of its proper divisors (447252042607).
20122020213233 is a wasteful number, since it uses less digits than its factorization.
20122020213233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2160638047.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 20122020213233 its reverse (33231202022102), we get a palindrome (53353222235335).
The spelling of 20122020213233 in words is "twenty trillion, one hundred twenty-two billion, twenty million, two hundred thirteen thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •