Base | Representation |
---|---|
bin | 10111001101111010010111… |
… | …111110011011101100110111 |
3 | 111101112201121021120222201222 |
4 | 113031322113332123230313 |
5 | 101340442014132033421 |
6 | 1001101105345540555 |
7 | 30336166206014354 |
oct | 2715722776335467 |
9 | 441481537528658 |
10 | 102111102221111 |
11 | 2a59909119a105 |
12 | b55199564475b |
13 | 44c9060354b49 |
14 | 1b302bd00162b |
15 | bc1226518cab |
hex | 5cde97f9bb37 |
102111102221111 has 16 divisors (see below), whose sum is σ = 104140601198400. Its totient is φ = 100099725454080.
The previous prime is 102111102221057. The next prime is 102111102221159. The reversal of 102111102221111 is 111122201111201.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102111102221111 is a prime.
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 102111102221111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102111102223111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9935021 + ... + 17404793.
It is an arithmetic number, because the mean of its divisors is an integer number (6508787574900).
Almost surely, 2102111102221111 is an apocalyptic number.
102111102221111 is a deficient number, since it is larger than the sum of its proper divisors (2029498977289).
102111102221111 is an equidigital number, since it uses as much as digits as its factorization.
102111102221111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7470986.
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 102111102221111 its reverse (111122201111201), we get a palindrome (213233303332312).
The spelling of 102111102221111 in words is "one hundred two trillion, one hundred eleven billion, one hundred two million, two hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •