Base | Representation |
---|---|
bin | 101101101101001111100101… |
… | …111000000000111110100011 |
3 | 222100202102212211100000002221 |
4 | 231231033211320000332203 |
5 | 202322012420010134334 |
6 | 1551311511445451511 |
7 | 60225206001630541 |
oct | 5555174570007643 |
9 | 870672784300087 |
10 | 201021211021219 |
11 | 59062687011446 |
12 | 1a667310a10b97 |
13 | 88222acab5144 |
14 | 378d69b110d91 |
15 | 1839052a378b4 |
hex | b6d3e5e00fa3 |
201021211021219 has 8 divisors (see below), whose sum is σ = 201063209476752. Its totient is φ = 200979216923520.
The previous prime is 201021211021171. The next prime is 201021211021243. The reversal of 201021211021219 is 912120112120102.
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 201021211021219 - 217 = 201021210890147 is a prime.
It is a super-2 number, since 2×2010212110212192 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201021211021193 and 201021211021202.
It is not an unprimeable number, because it can be changed into a prime (201021211021289) 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, 92006607 + ... + 94166119.
It is an arithmetic number, because the mean of its divisors is an integer number (25132901184594).
Almost surely, 2201021211021219 is an apocalyptic number.
201021211021219 is a deficient number, since it is larger than the sum of its proper divisors (41998455533).
201021211021219 is a wasteful number, since it uses less digits than its factorization.
201021211021219 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2178917.
The product of its (nonzero) digits is 288, while the sum is 25.
The spelling of 201021211021219 in words is "two hundred one trillion, twenty-one billion, two hundred eleven million, twenty-one thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •