Search a number
-
+
145245015651 = 3251192888467
BaseRepresentation
bin1000011101000101000…
…1110000111001100011
3111212220101010021121010
42013101101300321203
54334430211000101
6150420304432003
713331210156061
oct2072121607143
9455811107533
10145245015651
115666403001a
1224196318603
1310909409658
14705c06d031
153ba14252d6
hex21d1470e63

145245015651 has 8 divisors (see below), whose sum is σ = 194431575744. Its totient is φ = 96444233000.

The previous prime is 145245015613. The next prime is 145245015653. The reversal of 145245015651 is 156510542541.

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 145245015651 - 226 = 145177906787 is a prime.

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

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

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

Almost surely, 2145245015651 is an apocalyptic number.

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

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

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

The sum of its prime factors is 192888721.

The product of its (nonzero) digits is 120000, while the sum is 39.

The spelling of 145245015651 in words is "one hundred forty-five billion, two hundred forty-five million, fifteen thousand, six hundred fifty-one".

Divisors: 1 3 251 753 192888467 578665401 48415005217 145245015651