Base | Representation |
---|---|
bin | 101101101100111011111011… |
… | …101011100100100001100011 |
3 | 222100200102101201000200212010 |
4 | 231230323323223210201203 |
5 | 202321141202104134334 |
6 | 1551254101102404003 |
7 | 60223530622244514 |
oct | 5554737353444143 |
9 | 870612351020763 |
10 | 201000102021219 |
11 | 590547345902a6 |
12 | 1a6631bb590603 |
13 | 88202c77281b7 |
14 | 378c657826a0b |
15 | 18387197590e9 |
hex | b6cefbae4863 |
201000102021219 has 8 divisors (see below), whose sum is σ = 276645301706752. Its totient is φ = 129677485174920.
The previous prime is 201000102021203. The next prime is 201000102021317. The reversal of 201000102021219 is 912120201000102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201000102021219 - 24 = 201000102021203 is a prime.
It is a super-2 number, since 2×2010001020212192 (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 = 201000102021195 and 201000102021204.
It is not an unprimeable number, because it can be changed into a prime (201000102021319) 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, 1080645709699 + ... + 1080645709884.
It is an arithmetic number, because the mean of its divisors is an integer number (34580662713344).
Almost surely, 2201000102021219 is an apocalyptic number.
201000102021219 is a deficient number, since it is larger than the sum of its proper divisors (75645199685533).
201000102021219 is a wasteful number, since it uses less digits than its factorization.
201000102021219 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2161291419617.
The product of its (nonzero) digits is 144, while the sum is 21.
The spelling of 201000102021219 in words is "two hundred one trillion, one hundred two million, twenty-one thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •