Base | Representation |
---|---|
bin | 10111010010101101101111… |
… | …111100101000111010101111 |
3 | 111102201021111101211000122212 |
4 | 113102231233330220322233 |
5 | 101411343430121102421 |
6 | 1001512451140201035 |
7 | 30402062011406642 |
oct | 2722555774507257 |
9 | 442637441730585 |
10 | 102441143144111 |
11 | 2a7060547404a2 |
12 | b5a594369917b |
13 | 4521209b76525 |
14 | 1b4226bba1a59 |
15 | bc9ae11d6e5b |
hex | 5d2b6ff28eaf |
102441143144111 has 4 divisors (see below), whose sum is σ = 103970115429912. Its totient is φ = 100912170858312.
The previous prime is 102441143144083. The next prime is 102441143144113. The reversal of 102441143144111 is 111441341144201.
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 102441143144111 - 242 = 98043096633007 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102441143144113) 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, 764486142800 + ... + 764486142933.
It is an arithmetic number, because the mean of its divisors is an integer number (25992528857478).
Almost surely, 2102441143144111 is an apocalyptic number.
102441143144111 is a deficient number, since it is larger than the sum of its proper divisors (1528972285801).
102441143144111 is an equidigital number, since it uses as much as digits as its factorization.
102441143144111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1528972285800.
The product of its (nonzero) digits is 6144, while the sum is 32.
Adding to 102441143144111 its reverse (111441341144201), we get a palindrome (213882484288312).
The spelling of 102441143144111 in words is "one hundred two trillion, four hundred forty-one billion, one hundred forty-three million, one hundred forty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •