Base | Representation |
---|---|
bin | 1100101011100… |
… | …01111111111110 |
3 | 21102011022111010 |
4 | 12111301333332 |
5 | 204212414433 |
6 | 14315540050 |
7 | 2431104465 |
oct | 625617776 |
9 | 242138433 |
10 | 106373118 |
11 | 55054775 |
12 | 2b75a626 |
13 | 19065597 |
14 | 101ad9dc |
15 | 9512e63 |
hex | 6571ffe |
106373118 has 32 divisors (see below), whose sum is σ = 216870912. Its totient is φ = 34776000.
The previous prime is 106373117. The next prime is 106373119. The reversal of 106373118 is 811373601.
It is an interprime number because it is at equal distance from previous prime (106373117) and next prime (106373119).
It is a super-2 number, since 2×1063731182 = 22630480466083848, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106373117) 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, 91843 + ... + 92993.
It is an arithmetic number, because the mean of its divisors is an integer number (6777216).
Almost surely, 2106373118 is an apocalyptic number.
106373118 is an abundant number, since it is smaller than the sum of its proper divisors (110497794).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106373118 is a wasteful number, since it uses less digits than its factorization.
106373118 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1440.
The product of its (nonzero) digits is 3024, while the sum is 30.
The square root of 106373118 is about 10313.7344352082. The cubic root of 106373118 is about 473.8169903621.
It can be divided in two parts, 106373 and 118, that added together give a triangular number (106491 = T461).
The spelling of 106373118 in words is "one hundred six million, three hundred seventy-three thousand, one hundred eighteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •