Base | Representation |
---|---|
bin | 110000111111001111… |
… | …1010010001111011101 |
3 | 101001112122220001220200 |
4 | 1201332133102033131 |
5 | 3210423021024001 |
6 | 120155005534113 |
7 | 10412662453050 |
oct | 1417637221735 |
9 | 331478801820 |
10 | 105201345501 |
11 | 40685464a4a |
12 | 1847b874339 |
13 | 9bc72a6b85 |
14 | 513db74a97 |
15 | 2b0abb4086 |
hex | 187e7d23dd |
105201345501 has 12 divisors (see below), whose sum is σ = 173665713312. Its totient is φ = 60115054536.
The previous prime is 105201345493. The next prime is 105201345511. The reversal of 105201345501 is 105543102501.
105201345501 is a `hidden beast` number, since 1 + 0 + 5 + 20 + 134 + 5 + 501 = 666.
It is not a de Polignac number, because 105201345501 - 23 = 105201345493 is a prime.
It is a super-2 number, since 2×1052013455012 (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 (105201345511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 834931251 + ... + 834931376.
It is an arithmetic number, because the mean of its divisors is an integer number (14472142776).
Almost surely, 2105201345501 is an apocalyptic number.
It is an amenable number.
105201345501 is a deficient number, since it is larger than the sum of its proper divisors (68464367811).
105201345501 is a wasteful number, since it uses less digits than its factorization.
105201345501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1669862640 (or 1669862637 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 27.
The spelling of 105201345501 in words is "one hundred five billion, two hundred one million, three hundred forty-five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •