Search a number
-
+
145321500315 = 3525111385811
BaseRepresentation
bin1000011101010111010…
…1100001111010011011
3111220002201001002211110
42013111311201322123
54340104301002230
6150432040031403
713333126241325
oct2072565417233
9456081032743
10145321500315
11566a3220092
12241b7a62563
131091c208954
14706829c615
153ba7ed24b0
hex21d5d61e9b

145321500315 has 16 divisors (see below), whose sum is σ = 232524262656. Its totient is φ = 77501512800.

The previous prime is 145321500307. The next prime is 145321500349. The reversal of 145321500315 is 513005123541.

It is not a de Polignac number, because 145321500315 - 23 = 145321500307 is a prime.

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

It is an unprimeable number.

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

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

Almost surely, 2145321500315 is an apocalyptic number.

145321500315 is a gapful number since it is divisible by the number (15) formed by its first and last digit.

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

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

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

The sum of its prime factors is 410930.

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

Adding to 145321500315 its reverse (513005123541), we get a palindrome (658326623856).

The spelling of 145321500315 in words is "one hundred forty-five billion, three hundred twenty-one million, five hundred thousand, three hundred fifteen".

Divisors: 1 3 5 15 25111 75333 125555 376665 385811 1157433 1929055 5787165 9688100021 29064300063 48440500105 145321500315