Search a number
-
+
153691133 = 198089007
BaseRepresentation
bin10010010100100…
…10001111111101
3101201012022121012
421022102033331
5303321104013
623130045005
73544232051
oct1112221775
9351168535
10153691133
1179833472
1243579765
1325ac1ccb
14165a9c61
15d75d1a8
hex92923fd

153691133 has 4 divisors (see below), whose sum is σ = 161780160. Its totient is φ = 145602108.

The previous prime is 153691127. The next prime is 153691189. The reversal of 153691133 is 331196351.

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.

It is a cyclic number.

It is not a de Polignac number, because 153691133 - 28 = 153690877 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 153691133.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (153691123) 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, 4044485 + ... + 4044522.

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

Almost surely, 2153691133 is an apocalyptic number.

It is an amenable number.

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

153691133 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 8089026.

The product of its digits is 7290, while the sum is 32.

The square root of 153691133 is about 12397.2227938357. Note that the first 3 decimals coincide. The cubic root of 153691133 is about 535.6522548079.

The spelling of 153691133 in words is "one hundred fifty-three million, six hundred ninety-one thousand, one hundred thirty-three".

Divisors: 1 19 8089007 153691133