Base | Representation |
---|---|
bin | 10111001111001101001010… |
… | …101100101000010111111011 |
3 | 111101212020001201111011221102 |
4 | 113033031022230220113323 |
5 | 101343421100001201021 |
6 | 1001210010514202015 |
7 | 30345464162605433 |
oct | 2717151254502773 |
9 | 441766051434842 |
10 | 102200000022011 |
11 | 2a62285a733751 |
12 | b56706528330b |
13 | 4504559a064b8 |
14 | 1b3471378b2c3 |
15 | bc36cac2800b |
hex | 5cf34ab285fb |
102200000022011 has 4 divisors (see below), whose sum is σ = 102532899045192. Its totient is φ = 101867100998832.
The previous prime is 102200000021969. The next prime is 102200000022017. The reversal of 102200000022011 is 110220000002201.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 102200000022011 - 214 = 102200000005627 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102200000021983 and 102200000022001.
It is not an unprimeable number, because it can be changed into a prime (102200000022017) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 166449511130 + ... + 166449511743.
It is an arithmetic number, because the mean of its divisors is an integer number (25633224761298).
Almost surely, 2102200000022011 is an apocalyptic number.
102200000022011 is a deficient number, since it is larger than the sum of its proper divisors (332899023181).
102200000022011 is an equidigital number, since it uses as much as digits as its factorization.
102200000022011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 332899023180.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 102200000022011 its reverse (110220000002201), we get a palindrome (212420000024212).
The spelling of 102200000022011 in words is "one hundred two trillion, two hundred billion, twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •