Base | Representation |
---|---|
bin | 110000111011001011… |
… | …1011110010101010101 |
3 | 101001012011111001222210 |
4 | 1201312113132111111 |
5 | 3210133130031044 |
6 | 120133301144033 |
7 | 10406416306011 |
oct | 1416627362525 |
9 | 331164431883 |
10 | 105065080149 |
11 | 40615553857 |
12 | 184420bb019 |
13 | 9ba4ca66a3 |
14 | 5129a23541 |
15 | 2aedc491b9 |
hex | 18765de555 |
105065080149 has 16 divisors (see below), whose sum is σ = 146209392000. Its totient is φ = 66983406336.
The previous prime is 105065080147. The next prime is 105065080181. The reversal of 105065080149 is 941080560501.
It is not a de Polignac number, because 105065080149 - 21 = 105065080147 is a prime.
It is a super-2 number, since 2×1050650801492 (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 (105065080147) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 157017 + ... + 484545.
It is an arithmetic number, because the mean of its divisors is an integer number (9138087000).
Almost surely, 2105065080149 is an apocalyptic number.
It is an amenable number.
105065080149 is a deficient number, since it is larger than the sum of its proper divisors (41144311851).
105065080149 is a wasteful number, since it uses less digits than its factorization.
105065080149 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 332204.
The product of its (nonzero) digits is 43200, while the sum is 39.
The spelling of 105065080149 in words is "one hundred five billion, sixty-five million, eighty thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •