Base | Representation |
---|---|
bin | 110000111010100010… |
… | …0111100001000100111 |
3 | 101001010122202212010200 |
4 | 1201311010330020213 |
5 | 3210112110204023 |
6 | 120131205321543 |
7 | 10406034354432 |
oct | 1416504741047 |
9 | 331118685120 |
10 | 105043444263 |
11 | 4060431645a |
12 | 18436a062b3 |
13 | 9ba066c7a4 |
14 | 5126bd0819 |
15 | 2aebdc3743 |
hex | 187513c227 |
105043444263 has 6 divisors (see below), whose sum is σ = 151729419504. Its totient is φ = 70028962836.
The previous prime is 105043444217. The next prime is 105043444391. The reversal of 105043444263 is 362444340501.
105043444263 is a `hidden beast` number, since 1 + 0 + 50 + 4 + 344 + 4 + 263 = 666.
It is not a de Polignac number, because 105043444263 - 221 = 105041347111 is a prime.
It is a super-2 number, since 2×1050434442632 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105043434263) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5835746895 + ... + 5835746912.
It is an arithmetic number, because the mean of its divisors is an integer number (25288236584).
Almost surely, 2105043444263 is an apocalyptic number.
105043444263 is a deficient number, since it is larger than the sum of its proper divisors (46685975241).
105043444263 is a wasteful number, since it uses less digits than its factorization.
105043444263 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11671493813 (or 11671493810 counting only the distinct ones).
The product of its (nonzero) digits is 138240, while the sum is 36.
Adding to 105043444263 its reverse (362444340501), we get a palindrome (467487784764).
The spelling of 105043444263 in words is "one hundred five billion, forty-three million, four hundred forty-four thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •