Search a number
-
+
151110213 = 32931431303
BaseRepresentation
bin10010000000111…
…00001001000101
3101112100012020120
421000130021011
5302141011323
622554452153
73513262362
oct1100341105
9345305216
10151110213
1178330381
1242734059
13253ca337
14160d7469
15d3ed5e3
hex901c245

151110213 has 32 divisors (see below), whose sum is σ = 220323840. Its totient is φ = 91869120.

The previous prime is 151110209. The next prime is 151110221. The reversal of 151110213 is 312011151.

It is not a de Polignac number, because 151110213 - 22 = 151110209 is a prime.

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

It is a congruent number.

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 115320 + ... + 116622.

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

Almost surely, 2151110213 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1409.

The product of its (nonzero) digits is 30, while the sum is 15.

The square root of 151110213 is about 12292.6894128177. The cubic root of 151110213 is about 532.6369274711.

Adding to 151110213 its reverse (312011151), we get a palindrome (463121364).

The spelling of 151110213 in words is "one hundred fifty-one million, one hundred ten thousand, two hundred thirteen".

Divisors: 1 3 29 31 43 87 93 129 899 1247 1303 1333 2697 3741 3909 3999 37787 38657 40393 56029 113361 115971 121179 168087 1171397 1624841 1736899 3514191 4874523 5210697 50370071 151110213