Base | Representation |
---|---|
bin | 10001010111001… |
… | …11001111001100 |
3 | 101011001211010000 |
4 | 20223213033030 |
5 | 244241310021 |
6 | 22241444300 |
7 | 3416003265 |
oct | 1053471714 |
9 | 334054100 |
10 | 145650636 |
11 | 7524152a |
12 | 40940690 |
13 | 24238311 |
14 | 154b596c |
15 | cbc0b26 |
hex | 8ae73cc |
145650636 has 60 divisors (see below), whose sum is σ = 385113960. Its totient is φ = 47995200.
The previous prime is 145650623. The next prime is 145650653. The reversal of 145650636 is 636056541.
145650636 is a `hidden beast` number, since 14 + 5 + 6 + 5 + 0 + 636 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 145650636.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 26311 + ... + 31361.
It is an arithmetic number, because the mean of its divisors is an integer number (6418566).
Almost surely, 2145650636 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 145650636, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (192556980).
145650636 is an abundant number, since it is smaller than the sum of its proper divisors (239463324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145650636 is a wasteful number, since it uses less digits than its factorization.
145650636 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5156 (or 5145 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 36.
The square root of 145650636 is about 12068.5805296232. The cubic root of 145650636 is about 526.1434018454.
The spelling of 145650636 in words is "one hundred forty-five million, six hundred fifty thousand, six hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •