Base | Representation |
---|---|
bin | 1100101110000… |
… | …10100011101000 |
3 | 21102210002002221 |
4 | 12113002203220 |
5 | 204303444310 |
6 | 14331003424 |
7 | 2433650461 |
oct | 627024350 |
9 | 242702087 |
10 | 106703080 |
11 | 5525a670 |
12 | 2b899574 |
13 | 1914c823 |
14 | 10257d68 |
15 | 957aada |
hex | 65c28e8 |
106703080 has 64 divisors (see below), whose sum is σ = 263450880. Its totient is φ = 38572800.
The previous prime is 106703063. The next prime is 106703083. The reversal of 106703080 is 80307601.
It is a super-2 number, since 2×1067030802 = 22771094562972800, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106703083) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 86065 + ... + 87295.
It is an arithmetic number, because the mean of its divisors is an integer number (4116420).
Almost surely, 2106703080 is an apocalyptic number.
106703080 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 106703080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (131725440).
106703080 is an abundant number, since it is smaller than the sum of its proper divisors (156747800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106703080 is a wasteful number, since it uses less digits than its factorization.
106703080 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1450 (or 1446 counting only the distinct ones).
The product of its (nonzero) digits is 1008, while the sum is 25.
The square root of 106703080 is about 10329.7182923834. The cubic root of 106703080 is about 474.3064004346.
The spelling of 106703080 in words is "one hundred six million, seven hundred three thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •