Base | Representation |
---|---|
bin | 10010001001100… |
… | …01101010011101 |
3 | 101121110221112121 |
4 | 21010301222131 |
5 | 302433400231 |
6 | 23035102541 |
7 | 3526035430 |
oct | 1104615235 |
9 | 347427477 |
10 | 152246941 |
11 | 78a37420 |
12 | 42ba1a51 |
13 | 25707862 |
14 | 16311817 |
15 | d575311 |
hex | 9131a9d |
152246941 has 8 divisors (see below), whose sum is σ = 189814464. Its totient is φ = 118633920.
The previous prime is 152246929. The next prime is 152246947. The reversal of 152246941 is 149642251.
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 152246941 - 25 = 152246909 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 152246897 and 152246906.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (152246947) 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, 988540 + ... + 988693.
It is an arithmetic number, because the mean of its divisors is an integer number (23726808).
Almost surely, 2152246941 is an apocalyptic number.
152246941 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
152246941 is a deficient number, since it is larger than the sum of its proper divisors (37567523).
152246941 is a wasteful number, since it uses less digits than its factorization.
152246941 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1977251.
The product of its digits is 17280, while the sum is 34.
The square root of 152246941 is about 12338.8387216950. The cubic root of 152246941 is about 533.9691811715.
The spelling of 152246941 in words is "one hundred fifty-two million, two hundred forty-six thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •