Search a number
-
+
15055110131 = 229123753147
BaseRepresentation
bin11100000010101101…
…01011111111110011
31102212012211211120112
432001112223333303
5221313102011011
610525523131535
71042036216235
oct160126537763
942765754515
1015055110131
116426243086
122b01b13bab
13155c0a33b9
14a2b68c255
155d1a9d58b
hex3815abff3

15055110131 has 8 divisors (see below), whose sum is σ = 15133361520. Its totient is φ = 14976967968.

The previous prime is 15055110071. The next prime is 15055110139. The reversal of 15055110131 is 13101155051.

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 15055110131 - 26 = 15055110067 is a prime.

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

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (15055110139) 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, 256700 + ... + 309846.

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

Almost surely, 215055110131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 54613.

The product of its (nonzero) digits is 375, while the sum is 23.

Adding to 15055110131 its reverse (13101155051), we get a palindrome (28156265182).

The spelling of 15055110131 in words is "fifteen billion, fifty-five million, one hundred ten thousand, one hundred thirty-one".

Divisors: 1 229 1237 53147 283273 12170663 65742839 15055110131