Base | Representation |
---|---|
bin | 100001100101000011001010… |
… | …001110111000100100111100 |
3 | 201100220012220000202202212220 |
4 | 201211003022032320210330 |
5 | 123324103302342430202 |
6 | 1242031544452125340 |
7 | 43051432304306334 |
oct | 4145031216704474 |
9 | 640805800682786 |
10 | 147681548405052 |
11 | 4306843602a862 |
12 | 1469180b906850 |
13 | 645340583aa2c |
14 | 2867b7a0460c4 |
15 | 1211808e33abc |
hex | 8650ca3b893c |
147681548405052 has 48 divisors (see below), whose sum is σ = 356386221929472. Its totient is φ = 47548120746240.
The previous prime is 147681548405033. The next prime is 147681548405057. The reversal of 147681548405052 is 250504845186741.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (147681548405057) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 379340253 + ... + 379729364.
It is an arithmetic number, because the mean of its divisors is an integer number (7424712956864).
Almost surely, 2147681548405052 is an apocalyptic number.
147681548405052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
147681548405052 is an abundant number, since it is smaller than the sum of its proper divisors (208704673524420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
147681548405052 is a wasteful number, since it uses less digits than its factorization.
147681548405052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 759070178 (or 759070176 counting only the distinct ones).
The product of its (nonzero) digits is 43008000, while the sum is 60.
The spelling of 147681548405052 in words is "one hundred forty-seven trillion, six hundred eighty-one billion, five hundred forty-eight million, four hundred five thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •