Base | Representation |
---|---|
bin | 10001010010110… |
… | …01011111000000 |
3 | 101002222022122120 |
4 | 20221121133000 |
5 | 244114220031 |
6 | 22221204240 |
7 | 3411034440 |
oct | 1051313700 |
9 | 332868576 |
10 | 145070016 |
11 | 74985283 |
12 | 40700680 |
13 | 24093c60 |
14 | 153a4120 |
15 | cb08a96 |
hex | 8a597c0 |
145070016 has 336 divisors, whose sum is σ = 520257024. Its totient is φ = 34670592.
The previous prime is 145069979. The next prime is 145070021. The reversal of 145070016 is 610070541.
It is a tau number, because it is divible by the number of its divisors (336).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6307381 + ... + 6307403.
It is an arithmetic number, because the mean of its divisors is an integer number (1548384).
Almost surely, 2145070016 is an apocalyptic number.
145070016 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 145070016, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (260128512).
145070016 is an abundant number, since it is smaller than the sum of its proper divisors (375187008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145070016 is a wasteful number, since it uses less digits than its factorization.
145070016 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 96 (or 67 counting only the distinct ones).
The product of its (nonzero) digits is 840, while the sum is 24.
The square root of 145070016 is about 12044.5014840798. The cubic root of 145070016 is about 525.4433334605.
The spelling of 145070016 in words is "one hundred forty-five million, seventy thousand, sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •