Base | Representation |
---|---|
bin | 11100001100011101000010… |
… | …110101100111011010011101 |
3 | 121021001101120102000001222002 |
4 | 130030131002311213122131 |
5 | 112223113244232413031 |
6 | 1115421155030332045 |
7 | 35055533255303561 |
oct | 3414350265473235 |
9 | 537041512001862 |
10 | 124001122154141 |
11 | 365686428318a1 |
12 | 11aa82b8aba025 |
13 | 5426342861b2b |
14 | 22899874376a1 |
15 | e50848dc0ccb |
hex | 70c742d6769d |
124001122154141 has 8 divisors (see below), whose sum is σ = 124351547846400. Its totient is φ = 123650724344080.
The previous prime is 124001122154083. The next prime is 124001122154219. The reversal of 124001122154141 is 141451221100421.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-124001122154141 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (124001122654141) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1952780 + ... + 15868698.
It is an arithmetic number, because the mean of its divisors is an integer number (15543943480800).
Almost surely, 2124001122154141 is an apocalyptic number.
It is an amenable number.
124001122154141 is a deficient number, since it is larger than the sum of its proper divisors (350425692259).
124001122154141 is a wasteful number, since it uses less digits than its factorization.
124001122154141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13941099.
The product of its (nonzero) digits is 2560, while the sum is 29.
Adding to 124001122154141 its reverse (141451221100421), we get a palindrome (265452343254562).
The spelling of 124001122154141 in words is "one hundred twenty-four trillion, one billion, one hundred twenty-two million, one hundred fifty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •