Base | Representation |
---|---|
bin | 1110101101000… |
… | …10110001000000 |
3 | 22121002211111111 |
4 | 13112202301000 |
5 | 223034200310 |
6 | 20123453104 |
7 | 3025313140 |
oct | 726426100 |
9 | 277084444 |
10 | 123350080 |
11 | 6369a817 |
12 | 35387194 |
13 | 1c72aa19 |
14 | 1254c920 |
15 | ac6828a |
hex | 75a2c40 |
123350080 has 112 divisors (see below), whose sum is σ = 342351360. Its totient is φ = 41453568.
The previous prime is 123350069. The next prime is 123350083. The reversal of 123350080 is 80053321.
It is a tau number, because it is divible by the number of its divisors (112).
It is not an unprimeable number, because it can be changed into a prime (123350083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 118201 + ... + 119239.
Almost surely, 2123350080 is an apocalyptic number.
123350080 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 123350080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (171175680).
123350080 is an abundant number, since it is smaller than the sum of its proper divisors (219001280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
123350080 is a wasteful number, since it uses less digits than its factorization.
123350080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1116 (or 1106 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 22.
The square root of 123350080 is about 11106.3081174619. The cubic root of 123350080 is about 497.7903559983.
The spelling of 123350080 in words is "one hundred twenty-three million, three hundred fifty thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •