Base | Representation |
---|---|
bin | 1100101010110… |
… | …00010110011010 |
3 | 21101221222101000 |
4 | 12111120112122 |
5 | 204201034213 |
6 | 14313405430 |
7 | 2430156261 |
oct | 625302632 |
9 | 241858330 |
10 | 106268058 |
11 | 54a92846 |
12 | 2b709876 |
13 | 19029810 |
14 | 101835d8 |
15 | 94e1c73 |
hex | 655859a |
106268058 has 32 divisors (see below), whose sum is σ = 254318400. Its totient is φ = 32697648.
The previous prime is 106268053. The next prime is 106268069. The reversal of 106268058 is 850862601.
It is a happy number.
It is a super-3 number, since 3×1062680583 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (106268051) by changing a digit.
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, 74988 + ... + 76391.
It is an arithmetic number, because the mean of its divisors is an integer number (7947450).
Almost surely, 2106268058 is an apocalyptic number.
106268058 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
106268058 is an abundant number, since it is smaller than the sum of its proper divisors (148050342).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106268058 is a wasteful number, since it uses less digits than its factorization.
106268058 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151403 (or 151397 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 36.
The square root of 106268058 is about 10308.6399684924. The cubic root of 106268058 is about 473.6609496531.
The spelling of 106268058 in words is "one hundred six million, two hundred sixty-eight thousand, fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •