Base | Representation |
---|---|
bin | 101101101100111011110110… |
… | …010100001011001110101011 |
3 | 222100200102011102122021000002 |
4 | 231230323312110023032223 |
5 | 202321141011033032334 |
6 | 1551254044125133215 |
7 | 60223525450142453 |
oct | 5554736624131653 |
9 | 870612142567002 |
10 | 201000012002219 |
11 | 59054698796731 |
12 | 1a6631953ba20b |
13 | 88202b1b9a711 |
14 | 378c6498b2d63 |
15 | 18387118c6b7e |
hex | b6cef650b3ab |
201000012002219 has 8 divisors (see below), whose sum is σ = 203421969569280. Its totient is φ = 198578060879976.
The previous prime is 201000012002129. The next prime is 201000012002233. The reversal of 201000012002219 is 912200210000102.
It is a happy number.
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 201000012002219 - 228 = 200999743566763 is a prime.
It is a super-2 number, since 2×2010000120022192 (a number of 29 digits) contains 22 as substring.
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 201000012002219.
It is not an unprimeable number, because it can be changed into a prime (201000012007219) 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, 98074394 + ... + 100102880.
It is an arithmetic number, because the mean of its divisors is an integer number (25427746196160).
Almost surely, 2201000012002219 is an apocalyptic number.
201000012002219 is a deficient number, since it is larger than the sum of its proper divisors (2421957567061).
201000012002219 is a wasteful number, since it uses less digits than its factorization.
201000012002219 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3222409.
The product of its (nonzero) digits is 144, while the sum is 20.
The spelling of 201000012002219 in words is "two hundred one trillion, twelve million, two thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •