Base | Representation |
---|---|
bin | 100010101100101001111110… |
… | …110110000011001111010101 |
3 | 202000022122020210101001021111 |
4 | 202230221332312003033111 |
5 | 130000214020412001031 |
6 | 1300320311454015021 |
7 | 44100103436641051 |
oct | 4254517666031725 |
9 | 660278223331244 |
10 | 152602316125141 |
11 | 44695308133753 |
12 | 15147426aa7471 |
13 | 671c44b85a41c |
14 | 2997dc49b8c61 |
15 | 129980a7841b1 |
hex | 8aca7ed833d5 |
152602316125141 has 8 divisors (see below), whose sum is σ = 154121544957600. Its totient is φ = 151083250328400.
The previous prime is 152602316125123. The next prime is 152602316125163. The reversal of 152602316125141 is 141521613206251.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 152602316125141 - 25 = 152602316125109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 152602316125094 and 152602316125103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (152602316125841) 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, 38877171 + ... + 42622048.
It is an arithmetic number, because the mean of its divisors is an integer number (19265193119700).
Almost surely, 2152602316125141 is an apocalyptic number.
It is an amenable number.
152602316125141 is a deficient number, since it is larger than the sum of its proper divisors (1519228832459).
152602316125141 is a wasteful number, since it uses less digits than its factorization.
152602316125141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 81517859.
The product of its (nonzero) digits is 86400, while the sum is 40.
The spelling of 152602316125141 in words is "one hundred fifty-two trillion, six hundred two billion, three hundred sixteen million, one hundred twenty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •