Base | Representation |
---|---|
bin | 10010001011001… |
… | …10111100110001 |
3 | 101121220000221022 |
4 | 21011212330301 |
5 | 303012341301 |
6 | 23043505225 |
7 | 3530634650 |
oct | 1105467461 |
9 | 347800838 |
10 | 152465201 |
11 | 790763a9 |
12 | 43088215 |
13 | 25782cc5 |
14 | 1636b197 |
15 | d5b9d1b |
hex | 9166f31 |
152465201 has 4 divisors (see below), whose sum is σ = 174245952. Its totient is φ = 130684452.
The previous prime is 152465191. The next prime is 152465213. The reversal of 152465201 is 102564251.
152465201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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: 102564251 = 2579 ⋅39769.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-152465201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (152465251) 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, 10890365 + ... + 10890378.
It is an arithmetic number, because the mean of its divisors is an integer number (43561488).
Almost surely, 2152465201 is an apocalyptic number.
It is an amenable number.
152465201 is a deficient number, since it is larger than the sum of its proper divisors (21780751).
152465201 is an equidigital number, since it uses as much as digits as its factorization.
152465201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21780750.
The product of its (nonzero) digits is 2400, while the sum is 26.
The square root of 152465201 is about 12347.6799845153. The cubic root of 152465201 is about 534.2242239873.
The spelling of 152465201 in words is "one hundred fifty-two million, four hundred sixty-five thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •