Base | Representation |
---|---|
bin | 1000011100011100011… |
… | …0000001111001010000 |
3 | 111212110110122021211020 |
4 | 2013013012001321100 |
5 | 4334102441324001 |
6 | 150351322515440 |
7 | 13324034035125 |
oct | 2070706017120 |
9 | 455413567736 |
10 | 145074167376 |
11 | 565866491a6 |
12 | 24149065b80 |
13 | 108acbbb1b8 |
14 | 70434b874c |
15 | 3b91428736 |
hex | 21c7181e50 |
145074167376 has 80 divisors (see below), whose sum is σ = 378990237120. Its totient is φ = 47815971840.
The previous prime is 145074167369. The next prime is 145074167377. The reversal of 145074167376 is 673761470541.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145074167377) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2540676 + ... + 2597148.
It is an arithmetic number, because the mean of its divisors is an integer number (4737377964).
Almost surely, 2145074167376 is an apocalyptic number.
145074167376 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 145074167376, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (189495118560).
145074167376 is an abundant number, since it is smaller than the sum of its proper divisors (233916069744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145074167376 is a wasteful number, since it uses less digits than its factorization.
145074167376 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57084 (or 57078 counting only the distinct ones).
The product of its (nonzero) digits is 2963520, while the sum is 51.
The spelling of 145074167376 in words is "one hundred forty-five billion, seventy-four million, one hundred sixty-seven thousand, three hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •