Base | Representation |
---|---|
bin | 10001010111101… |
… | …01100101000000 |
3 | 101011011210200120 |
4 | 20223311211000 |
5 | 244300200001 |
6 | 22243020240 |
7 | 3416336451 |
oct | 1053654500 |
9 | 334153616 |
10 | 145709376 |
11 | 7528167a |
12 | 4096a680 |
13 | 24258c87 |
14 | 154cd128 |
15 | cbd3236 |
hex | 8af5940 |
145709376 has 56 divisors (see below), whose sum is σ = 389900160. Its totient is φ = 48018432.
The previous prime is 145709371. The next prime is 145709381. The reversal of 145709376 is 673907541.
It is an interprime number because it is at equal distance from previous prime (145709371) and next prime (145709381).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145709371) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12825 + ... + 21351.
Almost surely, 2145709376 is an apocalyptic number.
145709376 is a gapful number since it is divisible by the number (16) 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 145709376, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (194950080).
145709376 is an abundant number, since it is smaller than the sum of its proper divisors (244190784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145709376 is an equidigital number, since it uses as much as digits as its factorization.
145709376 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8631 (or 8621 counting only the distinct ones).
The product of its (nonzero) digits is 158760, while the sum is 42.
The square root of 145709376 is about 12071.0138762243. The cubic root of 145709376 is about 526.2141224650.
The spelling of 145709376 in words is "one hundred forty-five million, seven hundred nine thousand, three hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •