Base | Representation |
---|---|
bin | 110001101111010110… |
… | …0001011101010010100 |
3 | 101012201010220102222110 |
4 | 1203132230023222110 |
5 | 3222224211323111 |
6 | 121023103231020 |
7 | 10500661254651 |
oct | 1433654135224 |
9 | 335633812873 |
10 | 106815339156 |
11 | 413335242a9 |
12 | 188502a8470 |
13 | a0c379c1c6 |
14 | 525426cc28 |
15 | 2ba27295a6 |
hex | 18deb0ba94 |
106815339156 has 48 divisors (see below), whose sum is σ = 250574373504. Its totient is φ = 35414217216.
The previous prime is 106815339149. The next prime is 106815339157. The reversal of 106815339156 is 651933518601.
106815339156 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1068153391562 (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 (106815339157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2644545 + ... + 2684631.
It is an arithmetic number, because the mean of its divisors is an integer number (5220299448).
Almost surely, 2106815339156 is an apocalyptic number.
It is an amenable number.
106815339156 is an abundant number, since it is smaller than the sum of its proper divisors (143759034348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106815339156 is a wasteful number, since it uses less digits than its factorization.
106815339156 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41280 (or 41278 counting only the distinct ones).
The product of its (nonzero) digits is 583200, while the sum is 48.
The spelling of 106815339156 in words is "one hundred six billion, eight hundred fifteen million, three hundred thirty-nine thousand, one hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •