Search a number
-
+
15130101231 = 327491948823
BaseRepresentation
bin11100001011101001…
…10000010111101111
31110001102221210000200
432011310300113233
5221441301214411
610541202324543
71043636511210
oct160564602757
943042853020
1015130101231
116464602aa3
122b23059753
13157179b92b
14a3760d407
155d8462e56
hex385d305ef

15130101231 has 24 divisors (see below), whose sum is σ = 24982264320. Its totient is φ = 8643837456.

The previous prime is 15130101229. The next prime is 15130101263. The reversal of 15130101231 is 13210103151.

It is not a de Polignac number, because 15130101231 - 21 = 15130101229 is a prime.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 285486 + ... + 334308.

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

Almost surely, 215130101231 is an apocalyptic number.

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

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

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

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

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

Adding to 15130101231 its reverse (13210103151), we get a palindrome (28340204382).

The spelling of 15130101231 in words is "fifteen billion, one hundred thirty million, one hundred one thousand, two hundred thirty-one".

Divisors: 1 3 7 9 21 63 4919 14757 34433 44271 48823 103299 146469 309897 341761 439407 1025283 3075849 240160337 720481011 1681122359 2161443033 5043367077 15130101231