Base | Representation |
---|---|
bin | 10111111000100101011110… |
… | …110110100010100011000001 |
3 | 111202221001220112210002010200 |
4 | 113320211132312202203001 |
5 | 102232013301231420412 |
6 | 1011224211110115413 |
7 | 31061102331150024 |
oct | 2770453666424301 |
9 | 452831815702120 |
10 | 105043606513857 |
11 | 3051981a439a40 |
12 | b9461a334bb69 |
13 | 467c75351071b |
14 | 1bd21cdb2d1bb |
15 | c2265a4249dc |
hex | 5f895eda28c1 |
105043606513857 has 12 divisors (see below), whose sum is σ = 165523258749264. Its totient is φ = 63662791826520.
The previous prime is 105043606513829. The next prime is 105043606513891. The reversal of 105043606513857 is 758315606340501.
105043606513857 is a `hidden beast` number, since 1 + 0 + 5 + 0 + 43 + 6 + 0 + 6 + 513 + 85 + 7 = 666.
It is not a de Polignac number, because 105043606513857 - 216 = 105043606448321 is a prime.
It is a super-2 number, since 2×1050436065138572 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105043606513817) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 530523265123 + ... + 530523265320.
It is an arithmetic number, because the mean of its divisors is an integer number (13793604895772).
Almost surely, 2105043606513857 is an apocalyptic number.
It is an amenable number.
105043606513857 is a deficient number, since it is larger than the sum of its proper divisors (60479652235407).
105043606513857 is a wasteful number, since it uses less digits than its factorization.
105043606513857 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1061046530460 (or 1061046530457 counting only the distinct ones).
The product of its (nonzero) digits is 9072000, while the sum is 54.
The spelling of 105043606513857 in words is "one hundred five trillion, forty-three billion, six hundred six million, five hundred thirteen thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •