Base | Representation |
---|---|
bin | 101101100001010011111001… |
… | …011110000100100110101111 |
3 | 222020212001021220211102121010 |
4 | 231201103321132010212233 |
5 | 202220044024424323434 |
6 | 1545443055001240303 |
7 | 60112026251560620 |
oct | 5541237136044657 |
9 | 866761256742533 |
10 | 200201201011119 |
11 | 58876941810a20 |
12 | 1a554401193093 |
13 | 8792b7a367809 |
14 | 3761b0b419a47 |
15 | 1822a5cb9d9e9 |
hex | b614f97849af |
200201201011119 has 16 divisors (see below), whose sum is σ = 332801996486400. Its totient is φ = 104000623901760.
The previous prime is 200201201011043. The next prime is 200201201011169. The reversal of 200201201011119 is 911110102102002.
It is not a de Polignac number, because 200201201011119 - 216 = 200201200945583 is a prime.
It is a super-2 number, since 2×2002012010111192 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 200201201011095 and 200201201011104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200201201011169) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 433335932694 + ... + 433335933155.
It is an arithmetic number, because the mean of its divisors is an integer number (20800124780400).
Almost surely, 2200201201011119 is an apocalyptic number.
200201201011119 is a deficient number, since it is larger than the sum of its proper divisors (132600795475281).
200201201011119 is a wasteful number, since it uses less digits than its factorization.
200201201011119 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 866671865870.
The product of its (nonzero) digits is 72, while the sum is 21.
The spelling of 200201201011119 in words is "two hundred trillion, two hundred one billion, two hundred one million, eleven thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •