Search a number
-
+
153066001 = 1159235849
BaseRepresentation
bin10010001111110…
…01101000010001
3101200000120002011
421013321220101
5303141103001
623104422521
73536016364
oct1107715021
9350016064
10153066001
1179446830
1243317a41
13259335ca
14164860db
15d687d51
hex91f9a11

153066001 has 8 divisors (see below), whose sum is σ = 169812000. Its totient is φ = 136791840.

The previous prime is 153065999. The next prime is 153066007. The reversal of 153066001 is 100660351.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 153066001 - 21 = 153065999 is a prime.

It is a Duffinian number.

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

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

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

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

Almost surely, 2153066001 is an apocalyptic number.

153066001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

It is an amenable number.

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

153066001 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 235919.

The product of its (nonzero) digits is 540, while the sum is 22.

The square root of 153066001 is about 12371.9845214905. The cubic root of 153066001 is about 534.9250204993.

The spelling of 153066001 in words is "one hundred fifty-three million, sixty-six thousand, one".

Divisors: 1 11 59 649 235849 2594339 13915091 153066001