Base | Representation |
---|---|
bin | 10111001101110001001010… |
… | …011111000010011101000011 |
3 | 111101111210002000210102101121 |
4 | 113031301022133002131003 |
5 | 101340311240311223021 |
6 | 1001052352132413111 |
7 | 30335366135222566 |
oct | 2715611237023503 |
9 | 441453060712347 |
10 | 102101212211011 |
11 | 2a59497657a142 |
12 | b54ba95477197 |
13 | 44c8145398270 |
14 | 1b2da217104dd |
15 | bc0d48135741 |
hex | 5cdc4a7c2743 |
102101212211011 has 4 divisors (see below), whose sum is σ = 109955151611872. Its totient is φ = 94247272810152.
The previous prime is 102101212210993. The next prime is 102101212211051. The reversal of 102101212211011 is 110112212101201.
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 102101212211011 - 217 = 102101212079939 is a prime.
It is a super-3 number, since 3×1021012122110113 (a number of 43 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102101212211051) 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, 3926969700411 + ... + 3926969700436.
It is an arithmetic number, because the mean of its divisors is an integer number (27488787902968).
Almost surely, 2102101212211011 is an apocalyptic number.
102101212211011 is a deficient number, since it is larger than the sum of its proper divisors (7853939400861).
102101212211011 is an equidigital number, since it uses as much as digits as its factorization.
102101212211011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7853939400860.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 102101212211011 its reverse (110112212101201), we get a palindrome (212213424312212).
The spelling of 102101212211011 in words is "one hundred two trillion, one hundred one billion, two hundred twelve million, two hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •