Base | Representation |
---|---|
bin | 110000111111100110… |
… | …0101101110111100111 |
3 | 101001120111022010212112 |
4 | 1201333030231313213 |
5 | 3210434043131033 |
6 | 120200113111235 |
7 | 10413165625043 |
oct | 1417714556747 |
9 | 331514263775 |
10 | 105213255143 |
11 | 40691159927 |
12 | 1848385851b |
13 | 9bc98b69b9 |
14 | 5141595023 |
15 | 2b0bc67c48 |
hex | 187f32dde7 |
105213255143 has 4 divisors (see below), whose sum is σ = 106695132048. Its totient is φ = 103731378240.
The previous prime is 105213255109. The next prime is 105213255157. The reversal of 105213255143 is 341552312501.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 341552312501 = 137 ⋅2493082573.
It is a cyclic number.
It is not a de Polignac number, because 105213255143 - 230 = 104139513319 is a prime.
It is a super-2 number, since 2×1052132551432 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105213255943) 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, 740938346 + ... + 740938487.
It is an arithmetic number, because the mean of its divisors is an integer number (26673783012).
Almost surely, 2105213255143 is an apocalyptic number.
105213255143 is a deficient number, since it is larger than the sum of its proper divisors (1481876905).
105213255143 is an equidigital number, since it uses as much as digits as its factorization.
105213255143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1481876904.
The product of its (nonzero) digits is 18000, while the sum is 32.
Adding to 105213255143 its reverse (341552312501), we get a palindrome (446765567644).
The spelling of 105213255143 in words is "one hundred five billion, two hundred thirteen million, two hundred fifty-five thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •