Base | Representation |
---|---|
bin | 110001110010001011… |
… | …0001010110111010000 |
3 | 101012221202110111111211 |
4 | 1203210112022313100 |
5 | 3222423004411031 |
6 | 121040333145504 |
7 | 10503222656350 |
oct | 1434426126720 |
9 | 335852414454 |
10 | 106910232016 |
11 | 41382047755 |
12 | 1887802b294 |
13 | a10a345223 |
14 | 5262ad0b60 |
15 | 2baac20bb1 |
hex | 18e458add0 |
106910232016 has 20 divisors (see below), whose sum is σ = 236729799712. Its totient is φ = 45818670816.
The previous prime is 106910231999. The next prime is 106910232019. The reversal of 106910232016 is 610232019601.
It is a super-2 number, since 2×1069102320162 (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 (106910232019) 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, 477277710 + ... + 477277933.
Almost surely, 2106910232016 is an apocalyptic number.
106910232016 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
106910232016 is an abundant number, since it is smaller than the sum of its proper divisors (129819567696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106910232016 is an equidigital number, since it uses as much as digits as its factorization.
106910232016 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 954555658 (or 954555652 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 31.
The spelling of 106910232016 in words is "one hundred six billion, nine hundred ten million, two hundred thirty-two thousand, sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •