Base | Representation |
---|---|
bin | 11100010101110100000110… |
… | …110011100000110010000101 |
3 | 121100022212212202121112110002 |
4 | 130111310012303200302011 |
5 | 112314133122134023013 |
6 | 1121032454543211045 |
7 | 35153154303314330 |
oct | 3425640663406205 |
9 | 540285782545402 |
10 | 124644360064133 |
11 | 3679641586a0a8 |
12 | 11b90ab3ba6a85 |
13 | 5471bb3324860 |
14 | 22acb67d01617 |
15 | e62444b11358 |
hex | 715d06ce0c85 |
124644360064133 has 16 divisors (see below), whose sum is σ = 156672452590080. Its totient is φ = 96521421678336.
The previous prime is 124644360064073. The next prime is 124644360064153. The reversal of 124644360064133 is 331460063446421.
It is a cyclic number.
It is not a de Polignac number, because 124644360064133 - 232 = 124640065096837 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (47).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (124644360064153) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14571466388 + ... + 14571474941.
It is an arithmetic number, because the mean of its divisors is an integer number (9792028286880).
Almost surely, 2124644360064133 is an apocalyptic number.
124644360064133 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
124644360064133 is a deficient number, since it is larger than the sum of its proper divisors (32028092525947).
124644360064133 is a wasteful number, since it uses less digits than its factorization.
124644360064133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29142941396.
The product of its (nonzero) digits is 2985984, while the sum is 47.
The spelling of 124644360064133 in words is "one hundred twenty-four trillion, six hundred forty-four billion, three hundred sixty million, sixty-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •