Base | Representation |
---|---|
bin | 101111110010110100001100… |
… | …010000111110101010110010 |
3 | 1000120020221110100212202220221 |
4 | 233302310030100332222302 |
5 | 210022410002223223442 |
6 | 2023020345555523254 |
7 | 62163314625463042 |
oct | 5762641420765262 |
9 | 1016227410782827 |
10 | 210200200211122 |
11 | 60a8144a125100 |
12 | 1b6aa2598b952a |
13 | 9039a42065994 |
14 | 39c9a5b66d722 |
15 | 1947bc9d03467 |
hex | bf2d0c43eab2 |
210200200211122 has 24 divisors (see below), whose sum is σ = 361638001666368. Its totient is φ = 91391391393720.
The previous prime is 210200200211117. The next prime is 210200200211123. The reversal of 210200200211122 is 221112002002012.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 210200200211096 and 210200200211105.
It is not an unprimeable number, because it can be changed into a prime (210200200211123) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 18882513318 + ... + 18882524449.
It is an arithmetic number, because the mean of its divisors is an integer number (15068250069432).
Almost surely, 2210200200211122 is an apocalyptic number.
210200200211122 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
210200200211122 is a deficient number, since it is larger than the sum of its proper divisors (151437801455246).
210200200211122 is a wasteful number, since it uses less digits than its factorization.
210200200211122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37765037814 (or 37765037803 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 210200200211122 its reverse (221112002002012), we get a palindrome (431312202213134).
The spelling of 210200200211122 in words is "two hundred ten trillion, two hundred billion, two hundred million, two hundred eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •