Base | Representation |
---|---|
bin | 10010000111110… |
… | …00001011111101 |
3 | 101121000222121012 |
4 | 21003320023331 |
5 | 302403332032 |
6 | 23030045005 |
7 | 3524035160 |
oct | 1103701375 |
9 | 347028535 |
10 | 152011517 |
11 | 78896559 |
12 | 42aa9765 |
13 | 25654658 |
14 | 1628dad7 |
15 | d52a6b2 |
hex | 90f82fd |
152011517 has 4 divisors (see below), whose sum is σ = 173727456. Its totient is φ = 130295580.
The previous prime is 152011511. The next prime is 152011529. The reversal of 152011517 is 715110251.
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: 715110251 = 3613 ⋅197927.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-152011517 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 152011492 and 152011501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (152011511) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10857959 + ... + 10857972.
It is an arithmetic number, because the mean of its divisors is an integer number (43431864).
Almost surely, 2152011517 is an apocalyptic number.
It is an amenable number.
152011517 is a deficient number, since it is larger than the sum of its proper divisors (21715939).
152011517 is an equidigital number, since it uses as much as digits as its factorization.
152011517 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21715938.
The product of its (nonzero) digits is 350, while the sum is 23.
The square root of 152011517 is about 12329.2950731175. The cubic root of 152011517 is about 533.6938083434.
Adding to 152011517 its reverse (715110251), we get a palindrome (867121768).
The spelling of 152011517 in words is "one hundred fifty-two million, eleven thousand, five hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •