Base | Representation |
---|---|
bin | 10111001101110001001010… |
… | …111101001010111010111011 |
3 | 111101111210002120122201210011 |
4 | 113031301022331022322323 |
5 | 101340311244322010021 |
6 | 1001052353014002351 |
7 | 30335366262322003 |
oct | 2715611275127273 |
9 | 441453076581704 |
10 | 102101220110011 |
11 | 2a59497aa84841 |
12 | b54ba980463b7 |
13 | 44c8146c02725 |
14 | 1b2da227a9003 |
15 | bc0d48b95de1 |
hex | 5cdc4af4aebb |
102101220110011 has 4 divisors (see below), whose sum is σ = 102101244997024. Its totient is φ = 102101195223000.
The previous prime is 102101220109951. The next prime is 102101220110051. The reversal of 102101220110011 is 110011022101201.
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 102101220110011 - 211 = 102101220107963 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102101220109973 and 102101220110000.
It is not an unprimeable number, because it can be changed into a prime (102101220110051) 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, 4671555 + ... + 15034156.
It is an arithmetic number, because the mean of its divisors is an integer number (25525311249256).
Almost surely, 2102101220110011 is an apocalyptic number.
102101220110011 is a deficient number, since it is larger than the sum of its proper divisors (24887013).
102101220110011 is an equidigital number, since it uses as much as digits as its factorization.
102101220110011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24887012.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 102101220110011 its reverse (110011022101201), we get a palindrome (212112242211212).
The spelling of 102101220110011 in words is "one hundred two trillion, one hundred one billion, two hundred twenty million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •