Base | Representation |
---|---|
bin | 10001010010110… |
… | …00101111111000 |
3 | 101002222011111212 |
4 | 20221120233320 |
5 | 244114121000 |
6 | 22221142252 |
7 | 3411022601 |
oct | 1051305770 |
9 | 332864455 |
10 | 145067000 |
11 | 74982a91 |
12 | 406ba988 |
13 | 24092780 |
14 | 153a2da8 |
15 | cb07c35 |
hex | 8a58bf8 |
145067000 has 64 divisors (see below), whose sum is σ = 365601600. Its totient is φ = 53558400.
The previous prime is 145066981. The next prime is 145067023. The reversal of 145067000 is 760541.
145067000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
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, 7421 + ... + 18579.
It is an arithmetic number, because the mean of its divisors is an integer number (5712525).
Almost surely, 2145067000 is an apocalyptic number.
145067000 is a gapful number since it is divisible by the number (10) 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 145067000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (182800800).
145067000 is an abundant number, since it is smaller than the sum of its proper divisors (220534600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145067000 is a wasteful number, since it uses less digits than its factorization.
145067000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11193 (or 11179 counting only the distinct ones).
The product of its (nonzero) digits is 840, while the sum is 23.
The square root of 145067000 is about 12044.3762810699. The cubic root of 145067000 is about 525.4396921198.
The spelling of 145067000 in words is "one hundred forty-five million, sixty-seven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •