Base | Representation |
---|---|
bin | 1100101100010… |
… | …11101011100110 |
3 | 21102100122210010 |
4 | 12112023223212 |
5 | 204224301220 |
6 | 14322111050 |
7 | 2432023251 |
oct | 626135346 |
9 | 242318703 |
10 | 106478310 |
11 | 55116804 |
12 | 2b7ab486 |
13 | 190a1423 |
14 | 101da098 |
15 | 95341e0 |
hex | 658bae6 |
106478310 has 64 divisors (see below), whose sum is σ = 273341952. Its totient is φ = 26451456.
The previous prime is 106478287. The next prime is 106478371. The reversal of 106478310 is 13874601.
It is a happy number.
It is a super-2 number, since 2×1064783102 = 22675261000912200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 51517 + ... + 53543.
It is an arithmetic number, because the mean of its divisors is an integer number (4270968).
Almost surely, 2106478310 is an apocalyptic number.
106478310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 106478310, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (136670976).
106478310 is an abundant number, since it is smaller than the sum of its proper divisors (166863642).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106478310 is a wasteful number, since it uses less digits than its factorization.
106478310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2157.
The product of its (nonzero) digits is 4032, while the sum is 30.
The square root of 106478310 is about 10318.8327828297. The cubic root of 106478310 is about 473.9731242217.
The spelling of 106478310 in words is "one hundred six million, four hundred seventy-eight thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •