Search a number
-
+
145616005151 = 286150896891
BaseRepresentation
bin1000011110011101100…
…0111110100000011111
3111220212020012111111222
42013213120332200133
54341210144131101
6150521200203555
713343333423111
oct2074730764037
9456766174458
10145616005151
1156834490a11
122427a6095bb
1310968231476
1470954413b1
153bc3ca801b
hex21e763e81f

145616005151 has 4 divisors (see below), whose sum is σ = 145666904904. Its totient is φ = 145565105400.

The previous prime is 145616005141. The next prime is 145616005163. The reversal of 145616005151 is 151500616541.

It is a happy number.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 151500616541 = 178911800973.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-145616005151 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25445585 + ... + 25451306.

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

Almost surely, 2145616005151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 50899752.

The product of its (nonzero) digits is 18000, while the sum is 35.

The spelling of 145616005151 in words is "one hundred forty-five billion, six hundred sixteen million, five thousand, one hundred fifty-one".

Divisors: 1 2861 50896891 145616005151