Base | Representation |
---|---|
bin | 11100010001011011000111… |
… | …010010001110101101000000 |
3 | 121022021001002211121202120210 |
4 | 130101123013102032231000 |
5 | 112244212220021222000 |
6 | 1120242120122034120 |
7 | 35122313461606212 |
oct | 3421330722165500 |
9 | 538231084552523 |
10 | 124342646664000 |
11 | 3668a469487a36 |
12 | 11b42530948940 |
13 | 544c5cc53731b |
14 | 229c3053ca5b2 |
15 | e59686d03350 |
hex | 7116c748eb40 |
124342646664000 has 224 divisors, whose sum is σ = 421676163357696. Its totient is φ = 32261875660800.
The previous prime is 124342646663981. The next prime is 124342646664007. The reversal of 124342646664000 is 466646243421.
It is a happy number.
It is a super-2 number, since 2×1243426466640002 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (124342646664007) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 69124752 + ... + 70900751.
Almost surely, 2124342646664000 is an apocalyptic number.
124342646664000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
124342646664000 is an abundant number, since it is smaller than the sum of its proper divisors (297333516693696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
124342646664000 is a wasteful number, since it uses less digits than its factorization.
124342646664000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140025570 (or 140025550 counting only the distinct ones).
The product of its (nonzero) digits is 3981312, while the sum is 48.
The spelling of 124342646664000 in words is "one hundred twenty-four trillion, three hundred forty-two billion, six hundred forty-six million, six hundred sixty-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •