Base | Representation |
---|---|
bin | 10010001100011… |
… | …00100001110001 |
3 | 101122011212002001 |
4 | 21012030201301 |
5 | 303032302441 |
6 | 23051054001 |
7 | 3532145464 |
oct | 1106144161 |
9 | 348155061 |
10 | 152619121 |
11 | 79171006 |
12 | 43141301 |
13 | 25808095 |
14 | 163ab2db |
15 | d5ea731 |
hex | 918c871 |
152619121 has 8 divisors (see below), whose sum is σ = 154572264. Its totient is φ = 150673920.
The previous prime is 152619119. The next prime is 152619127. The reversal of 152619121 is 121916251.
It can be written as a sum of positive squares in 4 ways, for example, as 41422096 + 111197025 = 6436^2 + 10545^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 152619121 - 21 = 152619119 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 152619121.
It is not an unprimeable number, because it can be changed into a prime (152619127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 43011 + ... + 46423.
It is an arithmetic number, because the mean of its divisors is an integer number (19321533).
Almost surely, 2152619121 is an apocalyptic number.
It is an amenable number.
152619121 is a deficient number, since it is larger than the sum of its proper divisors (1953143).
152619121 is an equidigital number, since it uses as much as digits as its factorization.
152619121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3971.
The product of its digits is 1080, while the sum is 28.
The square root of 152619121 is about 12353.9111620571. The cubic root of 152619121 is about 534.4039374273.
The spelling of 152619121 in words is "one hundred fifty-two million, six hundred nineteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •