Base | Representation |
---|---|
bin | 10010001111111… |
… | …11011001101001 |
3 | 101200001202111201 |
4 | 21013333121221 |
5 | 303142332031 |
6 | 23105124201 |
7 | 3536145325 |
oct | 1107773151 |
9 | 350052451 |
10 | 153089641 |
11 | 79462571 |
12 | 43329661 |
13 | 259412b3 |
14 | 16490985 |
15 | d68ed61 |
hex | 91ff669 |
153089641 has 8 divisors (see below), whose sum is σ = 162262440. Its totient is φ = 143935488.
The previous prime is 153089627. The next prime is 153089647. The reversal of 153089641 is 146980351.
It can be written as a sum of positive squares in 4 ways, for example, as 4347225 + 148742416 = 2085^2 + 12196^2 .
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 153089641 - 211 = 153087593 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 153089641.
It is not an unprimeable number, because it can be changed into a prime (153089647) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14545 + ... + 22753.
It is an arithmetic number, because the mean of its divisors is an integer number (20282805).
Almost surely, 2153089641 is an apocalyptic number.
It is an amenable number.
153089641 is a deficient number, since it is larger than the sum of its proper divisors (9172799).
153089641 is a wasteful number, since it uses less digits than its factorization.
153089641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9323.
The product of its (nonzero) digits is 25920, while the sum is 37.
The square root of 153089641 is about 12372.9398689236. The cubic root of 153089641 is about 534.9525575888.
The spelling of 153089641 in words is "one hundred fifty-three million, eighty-nine thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •