Search a number
-
+
145363029504 = 2937113141967
BaseRepresentation
bin1000011101100001001…
…1111100111000000000
3111220012121012000011120
42013120103330320000
54340200413421004
6150440122112240
713334142235560
oct2073023747000
9456177160146
10145363029504
1156714705630
122420994b680
13109279b9534
14706d9ccda0
153bab9873d9
hex21d84fce00

145363029504 has 640 divisors, whose sum is σ = 511071289344. Its totient is φ = 35610624000.

The previous prime is 145363029481. The next prime is 145363029541. The reversal of 145363029504 is 405920363541.

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

It is a Harshad number since it is a multiple of its sum of digits (42).

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 150323229 + ... + 150324195.

Almost surely, 2145363029504 is an apocalyptic number.

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 145363029504, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (255535644672).

145363029504 is an abundant number, since it is smaller than the sum of its proper divisors (365708259840).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

145363029504 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 1078 (or 1062 counting only the distinct ones).

The product of its (nonzero) digits is 388800, while the sum is 42.

The spelling of 145363029504 in words is "one hundred forty-five billion, three hundred sixty-three million, twenty-nine thousand, five hundred four".