Base | Representation |
---|---|
bin | 101101100001011100010011… |
… | …000010110010001100001011 |
3 | 222020212220120110122112110202 |
4 | 231201130103002302030023 |
5 | 202220221012310000021 |
6 | 1545451145541402415 |
7 | 60112465614660104 |
oct | 5541342302621413 |
9 | 866786513575422 |
10 | 200210220000011 |
11 | 5887a74a7a1851 |
12 | 1a5560b970940b |
13 | 8793986a35c30 |
14 | 37623251753ab |
15 | 1822dd987ba0b |
hex | b617130b230b |
200210220000011 has 8 divisors (see below), whose sum is σ = 215614405755840. Its totient is φ = 184806519901632.
The previous prime is 200210219999987. The next prime is 200210220000029. The reversal of 200210220000011 is 110000022012002.
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 200210220000011 - 234 = 200193040130827 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200210219999947 and 200210220000001.
It is not an unprimeable number, because it can be changed into a prime (200210220000071) 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, 120557930 + ... + 122207343.
It is an arithmetic number, because the mean of its divisors is an integer number (26951800719480).
Almost surely, 2200210220000011 is an apocalyptic number.
200210220000011 is a deficient number, since it is larger than the sum of its proper divisors (15404185755829).
200210220000011 is a wasteful number, since it uses less digits than its factorization.
200210220000011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 242828725.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 200210220000011 its reverse (110000022012002), we get a palindrome (310210242012013).
The spelling of 200210220000011 in words is "two hundred trillion, two hundred ten billion, two hundred twenty million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •