Base | Representation |
---|---|
bin | 1100101111000… |
… | …01110011010110 |
3 | 21110000120200000 |
4 | 12113201303112 |
5 | 204322043222 |
6 | 14333432130 |
7 | 2435022552 |
oct | 627416326 |
9 | 243016600 |
10 | 106831062 |
11 | 55337838 |
12 | 2b93b646 |
13 | 19195b60 |
14 | 1028c862 |
15 | 95a39ac |
hex | 65e1cd6 |
106831062 has 96 divisors (see below), whose sum is σ = 266072352. Its totient is φ = 31912704.
The previous prime is 106831057. The next prime is 106831163. The reversal of 106831062 is 260138601.
It is a super-2 number, since 2×1068310622 = 22825751616095688, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 233538 + ... + 233994.
It is an arithmetic number, because the mean of its divisors is an integer number (2771587).
Almost surely, 2106831062 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 106831062, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (133036176).
106831062 is an abundant number, since it is smaller than the sum of its proper divisors (159241290).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106831062 is a wasteful number, since it uses less digits than its factorization.
106831062 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 524 (or 512 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
The square root of 106831062 is about 10335.9112805790. The cubic root of 106831062 is about 474.4959558143.
Adding to 106831062 its reverse (260138601), we get a palindrome (366969663).
The spelling of 106831062 in words is "one hundred six million, eight hundred thirty-one thousand, sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •