Base | Representation |
---|---|
bin | 11100011010100101100101… |
… | …101000010000100011000000 |
3 | 121101111020112020021200212210 |
4 | 130122211211220100203000 |
5 | 112340021402311322224 |
6 | 1121443302525422120 |
7 | 35215645535600442 |
oct | 3432454550204300 |
9 | 541436466250783 |
10 | 124972368464064 |
11 | 36902535a7a860 |
12 | 1202459540a940 |
13 | 5496ac7a22674 |
14 | 22c09a2b7c492 |
15 | e6ac41145429 |
hex | 71a965a108c0 |
124972368464064 has 1344 divisors, whose sum is σ = 410389157376000. Its totient is φ = 33128298086400.
The previous prime is 124972368464011. The next prime is 124972368464093. The reversal of 124972368464064 is 460464863279421.
It is a Harshad number since it is a multiple of its sum of digits (66).
It is a junction number, because it is equal to n+sod(n) for n = 124972368463986 and 124972368464004.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 169110105807 + ... + 169110106545.
Almost surely, 2124972368464064 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 124972368464064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (205194578688000).
124972368464064 is an abundant number, since it is smaller than the sum of its proper divisors (285416788911936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
124972368464064 is a wasteful number, since it uses less digits than its factorization.
124972368464064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 998 (or 947 counting only the distinct ones).
The product of its (nonzero) digits is 334430208, while the sum is 66.
The spelling of 124972368464064 in words is "one hundred twenty-four trillion, nine hundred seventy-two billion, three hundred sixty-eight million, four hundred sixty-four thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •