Base | Representation |
---|---|
bin | 1100101011000… |
… | …11111001011000 |
3 | 21102001101020122 |
4 | 12111203321120 |
5 | 204204042402 |
6 | 14314412412 |
7 | 2430444203 |
oct | 625437130 |
9 | 242041218 |
10 | 106315352 |
11 | 55015330 |
12 | 2b731108 |
13 | 190451c0 |
14 | 1019693a |
15 | 9500ca2 |
hex | 6563e58 |
106315352 has 64 divisors (see below), whose sum is σ = 235872000. Its totient is φ = 44288640.
The previous prime is 106315333. The next prime is 106315367. The reversal of 106315352 is 253513601.
It is a super-2 number, since 2×1063153522 = 22605908141767808, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 227423 + ... + 227889.
It is an arithmetic number, because the mean of its divisors is an integer number (3685500).
Almost surely, 2106315352 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 106315352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (117936000).
106315352 is an abundant number, since it is smaller than the sum of its proper divisors (129556648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106315352 is a wasteful number, since it uses less digits than its factorization.
106315352 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 696 (or 692 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 26.
The square root of 106315352 is about 10310.9336143727. The cubic root of 106315352 is about 473.7312059433.
Adding to 106315352 its reverse (253513601), we get a palindrome (359828953).
The spelling of 106315352 in words is "one hundred six million, three hundred fifteen thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •