Base | Representation |
---|---|
bin | 10111001111001101001011… |
… | …010010110001110001111011 |
3 | 111101212020002102022020100210 |
4 | 113033031023102301301323 |
5 | 101343421110031201021 |
6 | 1001210011512402203 |
7 | 30345464343605106 |
oct | 2717151322616173 |
9 | 441766072266323 |
10 | 102200010022011 |
11 | 2a622865343910 |
12 | b5670686a6363 |
13 | 450455bac8065 |
14 | 1b34714c3173d |
15 | bc36cba50e76 |
hex | 5cf34b4b1c7b |
102200010022011 has 32 divisors (see below), whose sum is σ = 151487681794560. Its totient is φ = 60759369632000.
The previous prime is 102200010022001. The next prime is 102200010022057. The reversal of 102200010022011 is 110220010002201.
It is a cyclic number.
It is not a de Polignac number, because 102200010022011 - 217 = 102200009890939 is a prime.
It is not an unprimeable number, because it can be changed into a prime (102200010022001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3898855 + ... + 14818943.
It is an arithmetic number, because the mean of its divisors is an integer number (4733990056080).
Almost surely, 2102200010022011 is an apocalyptic number.
102200010022011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
102200010022011 is a deficient number, since it is larger than the sum of its proper divisors (49287671772549).
102200010022011 is a wasteful number, since it uses less digits than its factorization.
102200010022011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10925507.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 102200010022011 its reverse (110220010002201), we get a palindrome (212420020024212).
It can be divided in two parts, 1022000 and 10022011, that added together give a palindrome (11044011).
The spelling of 102200010022011 in words is "one hundred two trillion, two hundred billion, ten million, twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •