Search a number
-
+
153057233 = 73446231
BaseRepresentation
bin10010001111101…
…11011111010001
3101200000010001102
421013313133101
5303140312413
623104314145
73535652000
oct1107673721
9350003042
10153057233
117944018a
1243312955
132592c614
1416482c37
15d685458
hex91f77d1

153057233 has 8 divisors (see below), whose sum is σ = 178492800. Its totient is φ = 131191620.

The previous prime is 153057221. The next prime is 153057241. The reversal of 153057233 is 332750351.

It is not a de Polignac number, because 153057233 - 26 = 153057169 is a prime.

It is a Duffinian number.

It is a Curzon number.

It is a junction number, because it is equal to n+sod(n) for n = 153057196 and 153057205.

It is not an unprimeable number, because it can be changed into a prime (153057263) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 222773 + ... + 223458.

It is an arithmetic number, because the mean of its divisors is an integer number (22311600).

Almost surely, 2153057233 is an apocalyptic number.

It is an amenable number.

153057233 is a deficient number, since it is larger than the sum of its proper divisors (25435567).

153057233 is an frugal number, since it uses more digits than its factorization.

153057233 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 446252 (or 446238 counting only the distinct ones).

The product of its (nonzero) digits is 9450, while the sum is 29.

The square root of 153057233 is about 12371.6301674436. The cubic root of 153057233 is about 534.9148063605.

The spelling of 153057233 in words is "one hundred fifty-three million, fifty-seven thousand, two hundred thirty-three".

Divisors: 1 7 49 343 446231 3123617 21865319 153057233