Base | Representation |
---|---|
bin | 101111110010110101000011… |
… | …001001111001100110001011 |
3 | 1000120021000211112200220000121 |
4 | 233302311003021321212023 |
5 | 210022413344000232334 |
6 | 2023021021213444111 |
7 | 62163346510101532 |
oct | 5762650311714613 |
9 | 1016230745626017 |
10 | 210201121102219 |
11 | 60a81881a26225 |
12 | 1b6aa4761a0637 |
13 | 9039b5aa95260 |
14 | 39c9b07aa7319 |
15 | 1947c30aa9db4 |
hex | bf2d4327998b |
210201121102219 has 8 divisors (see below), whose sum is σ = 226370568125520. Its totient is φ = 194031692652576.
The previous prime is 210201121102151. The next prime is 210201121102253. The reversal of 210201121102219 is 912201121102012.
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 210201121102219 - 29 = 210201121101707 is a prime.
It is a super-2 number, since 2×2102011211022192 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 210201121102193 and 210201121102202.
It is not an unprimeable number, because it can be changed into a prime (210201121105219) 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, 26694912 + ... + 33660370.
It is an arithmetic number, because the mean of its divisors is an integer number (28296321015690).
Almost surely, 2210201121102219 is an apocalyptic number.
210201121102219 is a deficient number, since it is larger than the sum of its proper divisors (16169447023301).
210201121102219 is a wasteful number, since it uses less digits than its factorization.
210201121102219 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9286829.
The product of its (nonzero) digits is 288, while the sum is 25.
The spelling of 210201121102219 in words is "two hundred ten trillion, two hundred one billion, one hundred twenty-one million, one hundred two thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •