Base | Representation |
---|---|
bin | 10010000111101… |
… | …10101001011101 |
3 | 101121000122221201 |
4 | 21003312221131 |
5 | 302403131323 |
6 | 23025555501 |
7 | 3524010613 |
oct | 1103665135 |
9 | 347018851 |
10 | 152005213 |
11 | 78891848 |
12 | 42aa5b91 |
13 | 25651819 |
14 | 1628b6b3 |
15 | d5288ad |
hex | 90f6a5d |
152005213 has 4 divisors (see below), whose sum is σ = 156113500. Its totient is φ = 147896928.
The previous prime is 152005201. The next prime is 152005223. The reversal of 152005213 is 312500251.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 312500251 = 7 ⋅44642893.
It can be written as a sum of positive squares in 2 ways, for example, as 128210329 + 23794884 = 11323^2 + 4878^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-152005213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (152005223) 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, 2054088 + ... + 2054161.
It is an arithmetic number, because the mean of its divisors is an integer number (39028375).
Almost surely, 2152005213 is an apocalyptic number.
It is an amenable number.
152005213 is a deficient number, since it is larger than the sum of its proper divisors (4108287).
152005213 is an equidigital number, since it uses as much as digits as its factorization.
152005213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4108286.
The product of its (nonzero) digits is 300, while the sum is 19.
The square root of 152005213 is about 12329.0394191924. The cubic root of 152005213 is about 533.6864307175.
Adding to 152005213 its reverse (312500251), we get a palindrome (464505464).
The spelling of 152005213 in words is "one hundred fifty-two million, five thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •