Base | Representation |
---|---|
bin | 10111001111001101011000… |
… | …011010110001110010100011 |
3 | 111101212020122202122121100101 |
4 | 113033031120122301302203 |
5 | 101343422032414114021 |
6 | 1001210045420203231 |
7 | 30345502656356404 |
oct | 2717153032616243 |
9 | 441766582577311 |
10 | 102200230223011 |
11 | 2a622968674108 |
12 | b56710a399517 |
13 | 45045956060cb |
14 | 1b347361919ab |
15 | bc36e104aa91 |
hex | 5cf3586b1ca3 |
102200230223011 has 6 divisors (see below), whose sum is σ = 105845898365012. Its totient is φ = 98676084352440.
The previous prime is 102200230222969. The next prime is 102200230223051. The reversal of 102200230223011 is 110322032002201.
It is not a de Polignac number, because 102200230223011 - 225 = 102200196668579 is a prime.
It is a super-2 number, since 2×1022002302230112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 102200230223011.
It is not an unprimeable number, because it can be changed into a prime (102200230223051) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 60761134845 + ... + 60761136526.
Almost surely, 2102200230223011 is an apocalyptic number.
102200230223011 is a deficient number, since it is larger than the sum of its proper divisors (3645668142001).
102200230223011 is an equidigital number, since it uses as much as digits as its factorization.
102200230223011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121522271429 (or 121522271400 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 102200230223011 its reverse (110322032002201), we get a palindrome (212522262225212).
The spelling of 102200230223011 in words is "one hundred two trillion, two hundred billion, two hundred thirty million, two hundred twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •