Search a number
-
+
151035201 = 32166710067
BaseRepresentation
bin10010000000010…
…01110101000001
3101112012101100100
421000021311001
5302131111301
622553113013
73512530602
oct1100116501
9345171310
10151035201
1178289a89
12426b8769
13253a2155
14160b7da9
15d3d6286
hex9009d41

151035201 has 12 divisors (see below), whose sum is σ = 218314512. Its totient is φ = 100619736.

The previous prime is 151035197. The next prime is 151035217. The reversal of 151035201 is 102530151.

It is not a de Polignac number, because 151035201 - 22 = 151035197 is a prime.

It is a super-2 number, since 2×1510352012 = 45623263882220802, which contains 22 as substring.

It is a Curzon number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9970 + ... + 20036.

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

Almost surely, 2151035201 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 150, while the sum is 18.

The square root of 151035201 is about 12289.6379523564. The cubic root of 151035201 is about 532.5487781806.

Adding to 151035201 its reverse (102530151), we get a palindrome (253565352).

The spelling of 151035201 in words is "one hundred fifty-one million, thirty-five thousand, two hundred one".

Divisors: 1 3 9 1667 5001 10067 15003 30201 90603 16781689 50345067 151035201