Search a number
-
+
152013115 = 5199152777
BaseRepresentation
bin10010000111110…
…00100100111011
3101121001001210101
421003320210323
5302403404430
623030100231
73524042632
oct1103704473
9347031711
10152013115
1178897781
1242aaa677
13256552b7
1416290519
15d52adca
hex90f893b

152013115 has 8 divisors (see below), whose sum is σ = 183333600. Its totient is φ = 120998592.

The previous prime is 152013107. The next prime is 152013179. The reversal of 152013115 is 511310251.

152013115 = T394 + T395 + ... + T990.

152013115 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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 152013115 - 23 = 152013107 is a prime.

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

It is an unprimeable number.

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

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

Almost surely, 2152013115 is an apocalyptic number.

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

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

152013115 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 152981.

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

The square root of 152013115 is about 12329.3598779499. The cubic root of 152013115 is about 533.6956784642.

Adding to 152013115 its reverse (511310251), we get a palindrome (663323366).

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

Divisors: 1 5 199 995 152777 763885 30402623 152013115