Search a number
-
+
13031545251 = 37954985423
BaseRepresentation
bin11000010001011110…
…11001100110100011
31020122012011002102010
430020233121212203
5203142033422001
65553035124003
7640635210204
oct141057314643
936565132363
1013031545251
115587a7090a
1226382a3603
1312c8a9812a
148b8a1b5ab
155140d38d6
hex308bd99a3

13031545251 has 8 divisors (see below), whose sum is σ = 17595335680. Its totient is φ = 8577725832.

The previous prime is 13031545201. The next prime is 13031545253. The reversal of 13031545251 is 15254513031.

13031545251 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 13031545251 - 27 = 13031545123 is a prime.

It is a Duffinian number.

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

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

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

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

Almost surely, 213031545251 is an apocalyptic number.

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

13031545251 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 54985505.

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

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

Divisors: 1 3 79 237 54985423 164956269 4343848417 13031545251