Base | Representation |
---|---|
bin | 10010001000011… |
… | …01110100101101 |
3 | 101121012111011120 |
4 | 21010031310231 |
5 | 302414201031 |
6 | 23032011153 |
7 | 3524554434 |
oct | 1104156455 |
9 | 347174146 |
10 | 152100141 |
11 | 789470a6 |
12 | 42b30ab9 |
13 | 25685aab |
14 | 162b411b |
15 | d546a96 |
hex | 910dd2d |
152100141 has 8 divisors (see below), whose sum is σ = 202949760. Its totient is φ = 101325312.
The previous prime is 152100121. The next prime is 152100209. The reversal of 152100141 is 141001251.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 152100141 - 26 = 152100077 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 152100141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (152100101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13765 + ... + 22218.
It is an arithmetic number, because the mean of its divisors is an integer number (25368720).
Almost surely, 2152100141 is an apocalyptic number.
It is an amenable number.
152100141 is a deficient number, since it is larger than the sum of its proper divisors (50849619).
152100141 is a wasteful number, since it uses less digits than its factorization.
152100141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37395.
The product of its (nonzero) digits is 40, while the sum is 15.
The square root of 152100141 is about 12332.8885910804. Note that the first 3 decimals coincide. The cubic root of 152100141 is about 533.7975041954.
Adding to 152100141 its reverse (141001251), we get a palindrome (293101392).
The spelling of 152100141 in words is "one hundred fifty-two million, one hundred thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •