Base | Representation |
---|---|
bin | 10010000111111… |
… | …00010110111101 |
3 | 101121001212001002 |
4 | 21003330112331 |
5 | 302404403410 |
6 | 23030300045 |
7 | 3524136041 |
oct | 1103742675 |
9 | 347055032 |
10 | 152028605 |
11 | 788a8383 |
12 | 42ab7625 |
13 | 2565c371 |
14 | 16296021 |
15 | d5307a5 |
hex | 90fc5bd |
152028605 has 4 divisors (see below), whose sum is σ = 182434332. Its totient is φ = 121622880.
The previous prime is 152028593. The next prime is 152028623. The reversal of 152028605 is 506820251.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 506820251 = 7 ⋅72402893.
It can be written as a sum of positive squares in 2 ways, for example, as 98942809 + 53085796 = 9947^2 + 7286^2 .
It is not a de Polignac number, because 152028605 - 24 = 152028589 is a prime.
It is a super-2 number, since 2×1520286052 = 46225393476492050, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15202856 + ... + 15202865.
It is an arithmetic number, because the mean of its divisors is an integer number (45608583).
Almost surely, 2152028605 is an apocalyptic number.
It is an amenable number.
152028605 is a deficient number, since it is larger than the sum of its proper divisors (30405727).
152028605 is an equidigital number, since it uses as much as digits as its factorization.
152028605 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30405726.
The product of its (nonzero) digits is 4800, while the sum is 29.
The square root of 152028605 is about 12329.9880373016. The cubic root of 152028605 is about 533.7138055521.
Adding to 152028605 its reverse (506820251), we get a palindrome (658848856).
The spelling of 152028605 in words is "one hundred fifty-two million, twenty-eight thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •