Base | Representation |
---|---|
bin | 11100001101001100111100… |
… | …000111110110001111001110 |
3 | 121021020022022102212121222212 |
4 | 130031030330013312033032 |
5 | 112224434110032203434 |
6 | 1115500542044310422 |
7 | 35062333545162020 |
oct | 3415147407661716 |
9 | 537208272777885 |
10 | 124052549100494 |
11 | 36588432a18853 |
12 | 11ab626b842412 |
13 | 542b14a1263c1 |
14 | 228c265492010 |
15 | e51d58b7e8ce |
hex | 70d33c1f63ce |
124052549100494 has 64 divisors (see below), whose sum is σ = 222548420616192. Its totient is φ = 50741070796800.
The previous prime is 124052549100451. The next prime is 124052549100497. The reversal of 124052549100494 is 494001945250421.
It is a super-3 number, since 3×1240525491004943 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (124052549100497) 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, 369909839 + ... + 370245045.
It is an arithmetic number, because the mean of its divisors is an integer number (3477319072128).
Almost surely, 2124052549100494 is an apocalyptic number.
124052549100494 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
124052549100494 is a deficient number, since it is larger than the sum of its proper divisors (98495871515698).
124052549100494 is a wasteful number, since it uses less digits than its factorization.
124052549100494 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 347001.
The product of its (nonzero) digits is 2073600, while the sum is 50.
Adding to 124052549100494 its sum of digits (50), we get a square (124052549100544 = 111378882).
The spelling of 124052549100494 in words is "one hundred twenty-four trillion, fifty-two billion, five hundred forty-nine million, one hundred thousand, four hundred ninety-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •