Base | Representation |
---|---|
bin | 110001000011111110… |
… | …0100010111110000111 |
3 | 101001221201110010020221 |
4 | 1202013330202332013 |
5 | 3211234130324033 |
6 | 120222434405211 |
7 | 10416630214102 |
oct | 1420774427607 |
9 | 331851403227 |
10 | 105360011143 |
11 | 40756a85882 |
12 | 18504a30807 |
13 | 9c2111b17a |
14 | 5156c77739 |
15 | 2b19aa612d |
hex | 1887f22f87 |
105360011143 has 4 divisors (see below), whose sum is σ = 105375560040. Its totient is φ = 105344462248.
The previous prime is 105360011111. The next prime is 105360011171. The reversal of 105360011143 is 341110063501.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 341110063501 = 17 ⋅20065297853.
It is a cyclic number.
It is not a de Polignac number, because 105360011143 - 25 = 105360011111 is a prime.
It is a super-2 number, since 2×1053600111432 (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 (105360071143) 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, 7764280 + ... + 7777837.
It is an arithmetic number, because the mean of its divisors is an integer number (26343890010).
Almost surely, 2105360011143 is an apocalyptic number.
105360011143 is a deficient number, since it is larger than the sum of its proper divisors (15548897).
105360011143 is an equidigital number, since it uses as much as digits as its factorization.
105360011143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15548896.
The product of its (nonzero) digits is 1080, while the sum is 25.
Adding to 105360011143 its reverse (341110063501), we get a palindrome (446470074644).
The spelling of 105360011143 in words is "one hundred five billion, three hundred sixty million, eleven thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •