Base | Representation |
---|---|
bin | 10111001111001110001100… |
… | …111111010010111001000011 |
3 | 111101212022221020021020102121 |
4 | 113033032030333102321003 |
5 | 101343430334211223021 |
6 | 1001210313124225111 |
7 | 30345533556216112 |
oct | 2717161477227103 |
9 | 441768836236377 |
10 | 102201112211011 |
11 | 2a623280513810 |
12 | b56731583b197 |
13 | 45046a62641b8 |
14 | 1b347bb37dc79 |
15 | bc37436ba741 |
hex | 5cf38cfd2e43 |
102201112211011 has 4 divisors (see below), whose sum is σ = 111492122412024. Its totient is φ = 92910102010000.
The previous prime is 102201112210997. The next prime is 102201112211057. The reversal of 102201112211011 is 110112211102201.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 102201112211011 - 29 = 102201112210499 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102201112611011) 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, 4645505100490 + ... + 4645505100511.
It is an arithmetic number, because the mean of its divisors is an integer number (27873030603006).
Almost surely, 2102201112211011 is an apocalyptic number.
102201112211011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
102201112211011 is a deficient number, since it is larger than the sum of its proper divisors (9291010201013).
102201112211011 is an equidigital number, since it uses as much as digits as its factorization.
102201112211011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9291010201012.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 102201112211011 its reverse (110112211102201), we get a palindrome (212313323313212).
The spelling of 102201112211011 in words is "one hundred two trillion, two hundred one billion, one hundred twelve million, two hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •