Base | Representation |
---|---|
bin | 1110110010011… |
… | …01101001010000 |
3 | 22122102101121110 |
4 | 13121031221100 |
5 | 223224100000 |
6 | 20150453320 |
7 | 3034256544 |
oct | 731155120 |
9 | 278371543 |
10 | 124050000 |
11 | 64028668 |
12 | 35664240 |
13 | 1c914489 |
14 | 12691a24 |
15 | ad55850 |
hex | 764da50 |
124050000 has 120 divisors (see below), whose sum is σ = 401036832. Its totient is φ = 33040000.
The previous prime is 124049977. The next prime is 124050013. The reversal of 124050000 is 50421.
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 149587 + ... + 150413.
Almost surely, 2124050000 is an apocalyptic number.
124050000 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 124050000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (200518416).
124050000 is an abundant number, since it is smaller than the sum of its proper divisors (276986832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
124050000 is an frugal number, since it uses more digits than its factorization.
124050000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 863 (or 837 counting only the distinct ones).
The product of its (nonzero) digits is 40, while the sum is 12.
The square root of 124050000 is about 11137.7735656638. The cubic root of 124050000 is about 498.7301108268.
The spelling of 124050000 in words is "one hundred twenty-four million, fifty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •