Base | Representation |
---|---|
bin | 111001010100110011… |
… | …1111111101110000000 |
3 | 102202202101121210211020 |
4 | 1302221213333232000 |
5 | 4004104324342100 |
6 | 132315325345440 |
7 | 11615440353432 |
oct | 1625147775600 |
9 | 382671553736 |
10 | 123104918400 |
11 | 48232576292 |
12 | 1ba37708280 |
13 | b7bb544ca9 |
14 | 5d5b860652 |
15 | 33078715a0 |
hex | 1ca99ffb80 |
123104918400 has 384 divisors, whose sum is σ = 421233039360. Its totient is φ = 31566028800.
The previous prime is 123104918383. The next prime is 123104918429. The reversal of 123104918400 is 4819401321.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (384).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 49697962 + ... + 49700438.
It is an arithmetic number, because the mean of its divisors is an integer number (1096961040).
Almost surely, 2123104918400 is an apocalyptic number.
123104918400 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 123104918400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (210616519680).
123104918400 is an abundant number, since it is smaller than the sum of its proper divisors (298128120960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
123104918400 is a wasteful number, since it uses less digits than its factorization.
123104918400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2702 (or 2685 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 33.
The spelling of 123104918400 in words is "one hundred twenty-three billion, one hundred four million, nine hundred eighteen thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •