Base | Representation |
---|---|
bin | 100001101000100101111100… |
… | …100100101011110010001000 |
3 | 201101202111102200020001011101 |
4 | 201220211330210223302020 |
5 | 123342101010002222330 |
6 | 1242335500033311144 |
7 | 43105142565142366 |
oct | 4150457444536210 |
9 | 641674380201141 |
10 | 147925058632840 |
11 | 431517352220a5 |
12 | 14710a4aa054b4 |
13 | 647037221a208 |
14 | 287587a996636 |
15 | 1217d0c11c4ca |
hex | 86897c92bc88 |
147925058632840 has 64 divisors (see below), whose sum is σ = 337524566112000. Its totient is φ = 58335706356480.
The previous prime is 147925058632777. The next prime is 147925058632843. The reversal of 147925058632840 is 48236850529741.
It is not an unprimeable number, because it can be changed into a prime (147925058632843) 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, 192136581 + ... + 192904939.
It is an arithmetic number, because the mean of its divisors is an integer number (5273821345500).
It is a 1-persistent number, because it is pandigital, but 2⋅147925058632840 = 295850117265680 is not.
Almost surely, 2147925058632840 is an apocalyptic number.
147925058632840 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
147925058632840 is an abundant number, since it is smaller than the sum of its proper divisors (189599507479160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
147925058632840 is a wasteful number, since it uses less digits than its factorization.
147925058632840 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 836230 (or 836226 counting only the distinct ones).
The product of its (nonzero) digits is 116121600, while the sum is 64.
The spelling of 147925058632840 in words is "one hundred forty-seven trillion, nine hundred twenty-five billion, fifty-eight million, six hundred thirty-two thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.056 sec. • engine limits •