Base | Representation |
---|---|
bin | 1001001100001100010000… |
… | …11111010000000010011001 |
3 | 2122120001211101102021202011 |
4 | 10212012020133100002121 |
5 | 10122110301410134314 |
6 | 110552221414305521 |
7 | 4154063251154554 |
oct | 446061037200231 |
9 | 78501741367664 |
10 | 20210111021209 |
11 | 649207288210a |
12 | 2324a313582a1 |
13 | b37a612c24a5 |
14 | 4dc26312169b |
15 | 250aa0ce84c4 |
hex | 1261887d0099 |
20210111021209 has 8 divisors (see below), whose sum is σ = 21089727406080. Its totient is φ = 19330570961856.
The previous prime is 20210111021201. The next prime is 20210111021237. The reversal of 20210111021209 is 90212011101202.
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 20210111021209 - 23 = 20210111021201 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20210111021209.
It is not an unprimeable number, because it can be changed into a prime (20210111021201) 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 7 ways as a sum of consecutive naturals, for example, 18539952 + ... + 19599745.
It is an arithmetic number, because the mean of its divisors is an integer number (2636215925760).
Almost surely, 220210111021209 is an apocalyptic number.
It is an amenable number.
20210111021209 is a deficient number, since it is larger than the sum of its proper divisors (879616384871).
20210111021209 is a wasteful number, since it uses less digits than its factorization.
20210111021209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38162759.
The product of its (nonzero) digits is 144, while the sum is 22.
The spelling of 20210111021209 in words is "twenty trillion, two hundred ten billion, one hundred eleven million, twenty-one thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •