Search a number
-
+
15150190217 = 131730915823
BaseRepresentation
bin11100001110000010…
…11000111010001001
31110002211202101221012
432013001120322021
5222011422041332
610543201053305
71044302330531
oct160701307211
943084671835
1015150190217
116474984168
122b29927235
1315759b36c6
14a3a15c4c1
155da0d03b2
hex387058e89

15150190217 has 8 divisors (see below), whose sum is σ = 15268894080. Its totient is φ = 15031532880.

The previous prime is 15150190213. The next prime is 15150190219. The reversal of 15150190217 is 71209105151.

It is a happy number.

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 15150190217 - 22 = 15150190213 is a prime.

It is a super-2 number, since 2×151501902172 (a number of 21 digits) contains 22 as substring.

It is a Duffinian number.

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

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

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

Almost surely, 215150190217 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 23263.

The product of its (nonzero) digits is 3150, while the sum is 32.

Adding to 15150190217 its reverse (71209105151), we get a palindrome (86359295368).

The spelling of 15150190217 in words is "fifteen billion, one hundred fifty million, one hundred ninety thousand, two hundred seventeen".

Divisors: 1 131 7309 15823 957479 2072813 115650307 15150190217