Base | Representation |
---|---|
bin | 1001001001101000100001… |
… | …01101110000011010110101 |
3 | 2122020122220212111002010101 |
4 | 10210310100231300122311 |
5 | 10114140232231241041 |
6 | 110444002335354101 |
7 | 4144531633465330 |
oct | 444642055603265 |
9 | 78218825432111 |
10 | 20122202212021 |
11 | 6458861622698 |
12 | 230b998982931 |
13 | b2c6917c5530 |
14 | 4d7cc3c59617 |
15 | 24d658343b31 |
hex | 124d10b706b5 |
20122202212021 has 32 divisors (see below), whose sum is σ = 24857223003648. Its totient is φ = 15862098309120.
The previous prime is 20122202211983. The next prime is 20122202212037. The reversal of 20122202212021 is 12021220222102.
It is not a de Polignac number, because 20122202212021 - 27 = 20122202211893 is a prime.
It is a super-2 number, since 2×201222022120212 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20122202212021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20122202218021) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 208790181 + ... + 208886533.
It is an arithmetic number, because the mean of its divisors is an integer number (776788218864).
Almost surely, 220122202212021 is an apocalyptic number.
It is an amenable number.
20122202212021 is a deficient number, since it is larger than the sum of its proper divisors (4735020791627).
20122202212021 is a wasteful number, since it uses less digits than its factorization.
20122202212021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 104821.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 20122202212021 its reverse (12021220222102), we get a palindrome (32143422434123).
The spelling of 20122202212021 in words is "twenty trillion, one hundred twenty-two billion, two hundred two million, two hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •