Base | Representation |
---|---|
bin | 110001110001111110… |
… | …1101100110000000000 |
3 | 101012221022101121001122 |
4 | 1203203331230300000 |
5 | 3222414334122331 |
6 | 121035543451412 |
7 | 10503114311330 |
oct | 1434375546000 |
9 | 335838347048 |
10 | 106903817216 |
11 | 41379466169 |
12 | 18875a56b68 |
13 | a108c0a4a1 |
14 | 5261d010c0 |
15 | 2baa3a517b |
hex | 18e3f6cc00 |
106903817216 has 88 divisors (see below), whose sum is σ = 250189842336. Its totient is φ = 44698337280.
The previous prime is 106903817197. The next prime is 106903817227. The reversal of 106903817216 is 612718309601.
It is a super-2 number, since 2×1069038172162 (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 (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 112010 + ... + 475766.
Almost surely, 2106903817216 is an apocalyptic number.
106903817216 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 106903817216, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (125094921168).
106903817216 is an abundant number, since it is smaller than the sum of its proper divisors (143286025120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106903817216 is an equidigital number, since it uses as much as digits as its factorization.
106903817216 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 363825 (or 363807 counting only the distinct ones).
The product of its (nonzero) digits is 108864, while the sum is 44.
The spelling of 106903817216 in words is "one hundred six billion, nine hundred three million, eight hundred seventeen thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •