Search a number
-
+
331513151132 = 221715132286049
BaseRepresentation
bin1001101001011111011…
…10010011111010011100
31011200200201110222020202
410310233232103322130
520412414331314012
6412143421203032
732644130201462
oct4645756237234
91150621428222
10331513151132
11118659593159
12542bb100478
132535283bbb7
141208c514832
15895407dcc2
hex4d2fb93e9c

331513151132 has 24 divisors (see below), whose sum is σ = 618342429600. Its totient is φ = 154973030400.

The previous prime is 331513151117. The next prime is 331513151173. The reversal of 331513151132 is 231151315133.

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

It is a congruent number.

It is an unprimeable number.

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

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

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

Almost surely, 2331513151132 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its digits is 4050, while the sum is 29.

Adding to 331513151132 its reverse (231151315133), we get a palindrome (562664466265).

The spelling of 331513151132 in words is "three hundred thirty-one billion, five hundred thirteen million, one hundred fifty-one thousand, one hundred thirty-two".

Divisors: 1 2 4 17 34 68 151 302 604 2567 5134 10268 32286049 64572098 129144196 548862833 1097725666 2195451332 4875193399 9750386798 19500773596 82878287783 165756575566 331513151132