Base | Representation |
---|---|
bin | 10010001101100… |
… | …01011110000001 |
3 | 101122110112122012 |
4 | 21012301132001 |
5 | 303102123213 |
6 | 23054222305 |
7 | 3533345564 |
oct | 1106613601 |
9 | 348415565 |
10 | 152770433 |
11 | 79264762 |
12 | 431b4995 |
13 | 2585bc0a |
14 | 1640a4db |
15 | d62a4a8 |
hex | 91b1781 |
152770433 has 4 divisors (see below), whose sum is σ = 155652948. Its totient is φ = 149887920.
The previous prime is 152770417. The next prime is 152770451. The reversal of 152770433 is 334077251.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 334077251 = 17 ⋅19651603.
It can be written as a sum of positive squares in 2 ways, for example, as 36626704 + 116143729 = 6052^2 + 10777^2 .
It is a cyclic number.
It is not a de Polignac number, because 152770433 - 24 = 152770417 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 152770433.
It is not an unprimeable number, because it can be changed into a prime (152770403) 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, 1441178 + ... + 1441283.
It is an arithmetic number, because the mean of its divisors is an integer number (38913237).
Almost surely, 2152770433 is an apocalyptic number.
It is an amenable number.
152770433 is a deficient number, since it is larger than the sum of its proper divisors (2882515).
152770433 is an equidigital number, since it uses as much as digits as its factorization.
152770433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2882514.
The product of its (nonzero) digits is 17640, while the sum is 32.
The square root of 152770433 is about 12360.0336973651. The cubic root of 152770433 is about 534.5804880886.
The spelling of 152770433 in words is "one hundred fifty-two million, seven hundred seventy thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •