Search a number
-
+
151325125601 = 1323796406381
BaseRepresentation
bin1000110011101110101…
…1100010101111100001
3112110121002220212110112
42030323223202233201
54434403213004401
6153303502341105
713634656226126
oct2147353425741
9473532825415
10151325125601
11591a40a7681
12253b258a795
1311367c73850
14747777274d
153e0a0d43bb
hex233bae2be1

151325125601 has 16 divisors (see below), whose sum is σ = 172203548160. Its totient is φ = 131920176960.

The previous prime is 151325125573. The next prime is 151325125669. The reversal of 151325125601 is 106521523151.

It is not a de Polignac number, because 151325125601 - 26 = 151325125537 is a prime.

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

It is a Duffinian number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3179570 + ... + 3226811.

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

Almost surely, 2151325125601 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 6406496.

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

Adding to 151325125601 its reverse (106521523151), we get a palindrome (257846648752).

The spelling of 151325125601 in words is "one hundred fifty-one billion, three hundred twenty-five million, one hundred twenty-five thousand, six hundred one".

Divisors: 1 13 23 79 299 1027 1817 23621 6406381 83282953 147346763 506104099 1915507919 6579353287 11640394277 151325125601