Base | Representation |
---|---|
bin | 110001110011111110… |
… | …1100000010001100000 |
3 | 101020002222120111000101 |
4 | 1203213331200101200 |
5 | 3223034020444401 |
6 | 121050341032144 |
7 | 10504560302110 |
oct | 1434775402140 |
9 | 336088514011 |
10 | 106970874976 |
11 | 414032a76a9 |
12 | 188943b5654 |
13 | a119a88a34 |
14 | 526ab99040 |
15 | 2bb11ee101 |
hex | 18e7f60460 |
106970874976 has 24 divisors (see below), whose sum is σ = 240684469200. Its totient is φ = 45844660608.
The previous prime is 106970874947. The next prime is 106970874977. The reversal of 106970874976 is 679478079601.
It is a super-2 number, since 2×1069708749762 (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 (106970874977) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 238774051 + ... + 238774498.
It is an arithmetic number, because the mean of its divisors is an integer number (10028519550).
Almost surely, 2106970874976 is an apocalyptic number.
106970874976 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
106970874976 is an abundant number, since it is smaller than the sum of its proper divisors (133713594224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106970874976 is an equidigital number, since it uses as much as digits as its factorization.
106970874976 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 477548566 (or 477548558 counting only the distinct ones).
The product of its (nonzero) digits is 32006016, while the sum is 64.
The spelling of 106970874976 in words is "one hundred six billion, nine hundred seventy million, eight hundred seventy-four thousand, nine hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •