Base | Representation |
---|---|
bin | 1001001100001111110011… |
… | …01111001000110010000001 |
3 | 2122120020201210120210000212 |
4 | 10212013321233020302001 |
5 | 10122123144304324301 |
6 | 110553134125523505 |
7 | 4154161321623152 |
oct | 446077157106201 |
9 | 78506653523025 |
10 | 20212011011201 |
11 | 6492958320779 |
12 | 2325281713595 |
13 | b37ca4b21619 |
14 | 4dc3a35c5929 |
15 | 250b62a034bb |
hex | 1261f9bc8c81 |
20212011011201 has 4 divisors (see below), whose sum is σ = 20220810321732. Its totient is φ = 20203211700672.
The previous prime is 20212011011177. The next prime is 20212011011209. The reversal of 20212011011201 is 10211011021202.
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 15213549207025 + 4998461804176 = 3900455^2 + 2235724^2 .
It is a cyclic number.
It is not a de Polignac number, because 20212011011201 - 218 = 20212010749057 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20212011011209) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4399651820 + ... + 4399656413.
It is an arithmetic number, because the mean of its divisors is an integer number (5055202580433).
Almost surely, 220212011011201 is an apocalyptic number.
It is an amenable number.
20212011011201 is a deficient number, since it is larger than the sum of its proper divisors (8799310531).
20212011011201 is an equidigital number, since it uses as much as digits as its factorization.
20212011011201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8799310530.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 20212011011201 its reverse (10211011021202), we get a palindrome (30423022032403).
The spelling of 20212011011201 in words is "twenty trillion, two hundred twelve billion, eleven million, eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •