Base | Representation |
---|---|
bin | 10010000111110… |
… | …01010010101001 |
3 | 101121001012210202 |
4 | 21003321102221 |
5 | 302404003131 |
6 | 23030121545 |
7 | 3524054312 |
oct | 1103712251 |
9 | 347035722 |
10 | 152016041 |
11 | 788999a1 |
12 | 42ab02b5 |
13 | 25656728 |
14 | 16291609 |
15 | d52bbcb |
hex | 90f94a9 |
152016041 has 4 divisors (see below), whose sum is σ = 154157184. Its totient is φ = 149874900.
The previous prime is 152016019. The next prime is 152016043. The reversal of 152016041 is 140610251.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 140610251 = 3373 ⋅41687.
It is a cyclic number.
It is not a de Polignac number, because 152016041 - 214 = 151999657 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (152016043) 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 3 ways as a sum of consecutive naturals, for example, 1070465 + ... + 1070606.
It is an arithmetic number, because the mean of its divisors is an integer number (38539296).
Almost surely, 2152016041 is an apocalyptic number.
It is an amenable number.
152016041 is a deficient number, since it is larger than the sum of its proper divisors (2141143).
152016041 is an equidigital number, since it uses as much as digits as its factorization.
152016041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2141142.
The product of its (nonzero) digits is 240, while the sum is 20.
The square root of 152016041 is about 12329.4785372294. The cubic root of 152016041 is about 533.6991026940.
Adding to 152016041 its reverse (140610251), we get a palindrome (292626292).
The spelling of 152016041 in words is "one hundred fifty-two million, sixteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •