Base | Representation |
---|---|
bin | 1000100110001011101… |
… | …0111001001110100110 |
3 | 112010012122221211201212 |
4 | 2021202322321032212 |
5 | 4404431223301430 |
6 | 151502552551422 |
7 | 13445600325452 |
oct | 2114272711646 |
9 | 463178854655 |
10 | 147688493990 |
11 | 576a8339504 |
12 | 247586b2572 |
13 | 10c0870911b |
14 | 72107a9662 |
15 | 3c95bd8b95 |
hex | 2262eb93a6 |
147688493990 has 64 divisors (see below), whose sum is σ = 288485245440. Its totient is φ = 54217359360.
The previous prime is 147688493957. The next prime is 147688494043. The reversal of 147688493990 is 99394886741.
147688493990 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1476884939902 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 147688493990.
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 31 ways as a sum of consecutive naturals, for example, 18947534 + ... + 18955326.
It is an arithmetic number, because the mean of its divisors is an integer number (4507581960).
Almost surely, 2147688493990 is an apocalyptic number.
147688493990 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
147688493990 is a deficient number, since it is larger than the sum of its proper divisors (140796751450).
147688493990 is a wasteful number, since it uses less digits than its factorization.
147688493990 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10577.
The product of its (nonzero) digits is 94058496, while the sum is 68.
The spelling of 147688493990 in words is "one hundred forty-seven billion, six hundred eighty-eight million, four hundred ninety-three thousand, nine hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •