Base | Representation |
---|---|
bin | 1000100011101011111… |
… | …0110101110101000000 |
3 | 112001110222010120110102 |
4 | 2020322332311311000 |
5 | 4402043210040000 |
6 | 151312255221532 |
7 | 13423153056335 |
oct | 2107276656500 |
9 | 461428116412 |
10 | 147018440000 |
11 | 57394092a83 |
12 | 245b02178a8 |
13 | 10b2c953283 |
14 | 71897c898c |
15 | 3c56e7e3d5 |
hex | 223afb5d40 |
147018440000 has 70 divisors (see below), whose sum is σ = 364558049394. Its totient is φ = 58807360000.
The previous prime is 147018439973. The next prime is 147018440011. The reversal of 147018440000 is 44810741.
147018440000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 5 ways, for example, as 62584028224 + 84434411776 = 250168^2 + 290576^2 .
It is a super-2 number, since 2×1470184400002 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 1797731 + ... + 1877730.
Almost surely, 2147018440000 is an apocalyptic number.
147018440000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
147018440000 is an abundant number, since it is smaller than the sum of its proper divisors (217539609394).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
147018440000 is an frugal number, since it uses more digits than its factorization.
147018440000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3675493 (or 3675468 counting only the distinct ones).
The product of its (nonzero) digits is 3584, while the sum is 29.
The spelling of 147018440000 in words is "one hundred forty-seven billion, eighteen million, four hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •