Base | Representation |
---|---|
bin | 10001100011111… |
… | …11101110100000 |
3 | 101021012211021100 |
4 | 20301333232200 |
5 | 300203330213 |
6 | 22341354400 |
7 | 3436142322 |
oct | 1061775640 |
9 | 337184240 |
10 | 147323808 |
11 | 76184615 |
12 | 41408a00 |
13 | 246a2a68 |
14 | 157cd612 |
15 | ce01773 |
hex | 8c7fba0 |
147323808 has 36 divisors (see below), whose sum is σ = 418952898. Its totient is φ = 49107840.
The previous prime is 147323807. The next prime is 147323833. The reversal of 147323808 is 808323741.
It can be written as a sum of positive squares in only one way, i.e., 147185424 + 138384 = 12132^2 + 372^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (147323807) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 255483 + ... + 256058.
Almost surely, 2147323808 is an apocalyptic number.
147323808 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
147323808 is an abundant number, since it is smaller than the sum of its proper divisors (271629090).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
147323808 is a wasteful number, since it uses less digits than its factorization.
147323808 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 511557 (or 511546 counting only the distinct ones).
The product of its (nonzero) digits is 32256, while the sum is 36.
The square root of 147323808 is about 12137.7019241700. The cubic root of 147323808 is about 528.1504392260.
It can be divided in two parts, 1473 and 23808, that added together give a square (25281 = 1592).
The spelling of 147323808 in words is "one hundred forty-seven million, three hundred twenty-three thousand, eight hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •