Base | Representation |
---|---|
bin | 110001100000110001… |
… | …1010110000100010000 |
3 | 101011110002000222200220 |
4 | 1203001203112010100 |
5 | 3220224034430331 |
6 | 120502401313040 |
7 | 10452604123662 |
oct | 1430143260420 |
9 | 334402028626 |
10 | 106326483216 |
11 | 41102589628 |
12 | 18734635780 |
13 | a046419635 |
14 | 5209378532 |
15 | 2b74863296 |
hex | 18c18d6110 |
106326483216 has 80 divisors (see below), whose sum is σ = 281674162176. Its totient is φ = 34542845568.
The previous prime is 106326483149. The next prime is 106326483227. The reversal of 106326483216 is 612384623601.
It is a super-2 number, since 2×1063264832162 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 900001 + ... + 1011263.
Almost surely, 2106326483216 is an apocalyptic number.
106326483216 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 106326483216, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (140837081088).
106326483216 is an abundant number, since it is smaller than the sum of its proper divisors (175347678960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106326483216 is a wasteful number, since it uses less digits than its factorization.
106326483216 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111780 (or 111774 counting only the distinct ones).
The product of its (nonzero) digits is 248832, while the sum is 42.
The spelling of 106326483216 in words is "one hundred six billion, three hundred twenty-six million, four hundred eighty-three thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •