Search a number
-
+
145122056151 = 3458310555099
BaseRepresentation
bin1000011100100111110…
…0101101011111010111
3111212120210202021212120
42013021330231133113
54334202221244101
6150400153151023
713325155060422
oct2071174553727
9455523667776
10145122056151
11566006877a6
12241610bb473
13108b9ab7657
1470499c29b9
153b95737b36
hex21c9f2d7d7

145122056151 has 8 divisors (see below), whose sum is σ = 193538313600. Its totient is φ = 96726918072.

The previous prime is 145122056143. The next prime is 145122056171. The reversal of 145122056151 is 151650221541.

It is a happy number.

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

It is not a de Polignac number, because 145122056151 - 23 = 145122056143 is a prime.

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

It is a congruent number.

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

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, 5263801 + ... + 5291298.

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

Almost surely, 2145122056151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 10559685.

The product of its (nonzero) digits is 12000, while the sum is 33.

Adding to 145122056151 its reverse (151650221541), we get a palindrome (296772277692).

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

Divisors: 1 3 4583 13749 10555099 31665297 48374018717 145122056151