Base | Representation |
---|---|
bin | 1100101100001… |
… | …10110011110000 |
3 | 21102022122101221 |
4 | 12112012303300 |
5 | 204223131402 |
6 | 14321434424 |
7 | 2431611130 |
oct | 626066360 |
9 | 242278357 |
10 | 106458352 |
11 | 55102810 |
12 | 2b79ba14 |
13 | 19095310 |
14 | 101d2ac0 |
15 | 952d337 |
hex | 6586cf0 |
106458352 has 240 divisors, whose sum is σ = 306980352. Its totient is φ = 34467840.
The previous prime is 106458347. The next prime is 106458353. The reversal of 106458352 is 253854601.
It is a super-2 number, since 2×1064583522 = 22666761421111808, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (34).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106458353) 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 47 ways as a sum of consecutive naturals, for example, 4628613 + ... + 4628635.
Almost surely, 2106458352 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 106458352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (153490176).
106458352 is an abundant number, since it is smaller than the sum of its proper divisors (200522000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106458352 is a wasteful number, since it uses less digits than its factorization.
106458352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96 (or 73 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 34.
The square root of 106458352 is about 10317.8656707674. The cubic root of 106458352 is about 473.9435089673.
The spelling of 106458352 in words is "one hundred six million, four hundred fifty-eight thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.010 sec. • engine limits •