Base | Representation |
---|---|
bin | 110001100000100101… |
… | …0110000101001101100 |
3 | 101011102121220120020000 |
4 | 1203001022300221230 |
5 | 3220220412213013 |
6 | 120502011224300 |
7 | 10452465262515 |
oct | 1430112605154 |
9 | 334377816200 |
10 | 106320038508 |
11 | 410a9987622 |
12 | 18732448090 |
13 | a044ca10b8 |
14 | 520857ba0c |
15 | 2b73edd973 |
hex | 18c12b0a6c |
106320038508 has 60 divisors (see below), whose sum is σ = 278123020560. Its totient is φ = 35416878048.
The previous prime is 106320038507. The next prime is 106320038537. The reversal of 106320038508 is 805830023601.
106320038508 is a `hidden beast` number, since 10 + 63 + 200 + 385 + 0 + 8 = 666.
It is a super-2 number, since 2×1063200385082 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (106320038507) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 393598 + ... + 606266.
It is an arithmetic number, because the mean of its divisors is an integer number (4635383676).
Almost surely, 2106320038508 is an apocalyptic number.
106320038508 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
106320038508 is an abundant number, since it is smaller than the sum of its proper divisors (171802982052).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106320038508 is a wasteful number, since it uses less digits than its factorization.
106320038508 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 214228 (or 214217 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 36.
The spelling of 106320038508 in words is "one hundred six billion, three hundred twenty million, thirty-eight thousand, five hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •