Base | Representation |
---|---|
bin | 110010010011000011… |
… | …1100000000001011101 |
3 | 101022210122210121101200 |
4 | 1210212013200001131 |
5 | 3232203000322111 |
6 | 121342032030113 |
7 | 10542452104104 |
oct | 1444607400135 |
9 | 338718717350 |
10 | 108013682781 |
11 | 418989a9634 |
12 | 18b25692339 |
13 | a254b33784 |
14 | 532948b03b |
15 | 2c22a39256 |
hex | 19261e005d |
108013682781 has 12 divisors (see below), whose sum is σ = 156094764540. Its totient is φ = 71974506240.
The previous prime is 108013682767. The next prime is 108013682809. The reversal of 108013682781 is 187286310801.
It is a happy number.
108013682781 is a `hidden beast` number, since 10 + 8 + 0 + 1 + 368 + 278 + 1 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 69029154756 + 38984528025 = 262734^2 + 197445^2 .
It is not a de Polignac number, because 108013682781 - 29 = 108013682269 is a prime.
It is a super-2 number, since 2×1080136827812 (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 (108013682701) 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, 2864866 + ... + 2902323.
It is an arithmetic number, because the mean of its divisors is an integer number (13007897045).
Almost surely, 2108013682781 is an apocalyptic number.
It is an amenable number.
108013682781 is a deficient number, since it is larger than the sum of its proper divisors (48081081759).
108013682781 is a wasteful number, since it uses less digits than its factorization.
108013682781 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5769276 (or 5769273 counting only the distinct ones).
The product of its (nonzero) digits is 129024, while the sum is 45.
The spelling of 108013682781 in words is "one hundred eight billion, thirteen million, six hundred eighty-two thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •