Base | Representation |
---|---|
bin | 1110111000010… |
… | …11010111000000 |
3 | 22200212212112220 |
4 | 13130023113000 |
5 | 223423431242 |
6 | 20215251040 |
7 | 3044004216 |
oct | 734132700 |
9 | 280785486 |
10 | 124827072 |
11 | 64509477 |
12 | 35979a80 |
13 | 1cb27096 |
14 | 12814cb6 |
15 | ae5abec |
hex | 770b5c0 |
124827072 has 84 divisors (see below), whose sum is σ = 345536520. Its totient is φ = 39767552.
The previous prime is 124827013. The next prime is 124827091. The reversal of 124827072 is 270728421.
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 11 ways as a sum of consecutive naturals, for example, 100954 + ... + 102182.
It is an arithmetic number, because the mean of its divisors is an integer number (4113530).
Almost surely, 2124827072 is an apocalyptic number.
124827072 is a gapful number since it is divisible by the number (12) 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 124827072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (172768260).
124827072 is an abundant number, since it is smaller than the sum of its proper divisors (220709448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
124827072 is a wasteful number, since it uses less digits than its factorization.
124827072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1290 (or 1257 counting only the distinct ones).
The product of its (nonzero) digits is 12544, while the sum is 33.
The square root of 124827072 is about 11172.6036356796. The cubic root of 124827072 is about 499.7693229259.
The spelling of 124827072 in words is "one hundred twenty-four million, eight hundred twenty-seven thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •