Base | Representation |
---|---|
bin | 101111110010110100000111… |
… | …100010110100000010111001 |
3 | 1000120020221020211211102212011 |
4 | 233302310013202310002321 |
5 | 210022404321434000441 |
6 | 2023020334050045521 |
7 | 62163312644264140 |
oct | 5762640742640271 |
9 | 1016227224742764 |
10 | 210200121000121 |
11 | 60a8140944276a |
12 | 1b6aa2372798a1 |
13 | 9039a2b820775 |
14 | 39c9a50d30757 |
15 | 1947bc2da8581 |
hex | bf2d078b40b9 |
210200121000121 has 16 divisors (see below), whose sum is σ = 240542367099264. Its totient is φ = 179936386084224.
The previous prime is 210200121000083. The next prime is 210200121000137. The reversal of 210200121000121 is 121000121002012.
210200121000121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 210200121000121 - 27 = 210200120999993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (210200121009121) 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, 22031151 + ... + 30096043.
It is an arithmetic number, because the mean of its divisors is an integer number (15033897943704).
Almost surely, 2210200121000121 is an apocalyptic number.
It is an amenable number.
210200121000121 is a deficient number, since it is larger than the sum of its proper divisors (30342246099143).
210200121000121 is an equidigital number, since it uses as much as digits as its factorization.
210200121000121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8069760.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 210200121000121 its reverse (121000121002012), we get a palindrome (331200242002133).
The spelling of 210200121000121 in words is "two hundred ten trillion, two hundred billion, one hundred twenty-one million, one hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •