Base | Representation |
---|---|
bin | 10001011001100… |
… | …10111101101100 |
3 | 101011122120121000 |
4 | 20230302331230 |
5 | 244331221222 |
6 | 22252240300 |
7 | 3421434504 |
oct | 1054627554 |
9 | 334576530 |
10 | 145960812 |
11 | 75433578 |
12 | 40a70090 |
13 | 2431655a |
14 | 15556a04 |
15 | cc329ac |
hex | 8b32f6c |
145960812 has 96 divisors (see below), whose sum is σ = 403603200. Its totient is φ = 45484416.
The previous prime is 145960807. The next prime is 145960823. The reversal of 145960812 is 218069541.
145960812 is a `hidden beast` number, since 1 + 45 + 9 + 608 + 1 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 169888 + ... + 170744.
It is an arithmetic number, because the mean of its divisors is an integer number (4204200).
Almost surely, 2145960812 is an apocalyptic number.
145960812 is a gapful number since it is divisible by the number (12) 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 145960812, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (201801600).
145960812 is an abundant number, since it is smaller than the sum of its proper divisors (257642388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145960812 is a wasteful number, since it uses less digits than its factorization.
145960812 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 972 (or 964 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 36.
The square root of 145960812 is about 12081.4242537873. The cubic root of 145960812 is about 526.5166267750.
The spelling of 145960812 in words is "one hundred forty-five million, nine hundred sixty thousand, eight hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •