Base | Representation |
---|---|
bin | 1000001111101011100… |
… | …0101000110100110000 |
3 | 111112121200220021102221 |
4 | 2003322320220310300 |
5 | 4310043403323002 |
6 | 145023334250424 |
7 | 13143113011300 |
oct | 2037270506460 |
9 | 445550807387 |
10 | 141648104752 |
11 | 55088731690 |
12 | 235517b6a14 |
13 | 1048516b5cb |
14 | 6bda485600 |
15 | 3a40773c37 |
hex | 20fae28d30 |
141648104752 has 480 divisors, whose sum is σ = 391626005760. Its totient is φ = 48771072000.
The previous prime is 141648104749. The next prime is 141648104797. The reversal of 141648104752 is 257401846141.
It is a junction number, because it is equal to n+sod(n) for n = 141648104699 and 141648104708.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 587751352 + ... + 587751592.
It is an arithmetic number, because the mean of its divisors is an integer number (815887512).
Almost surely, 2141648104752 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 141648104752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (195813002880).
141648104752 is an abundant number, since it is smaller than the sum of its proper divisors (249977901008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141648104752 is a wasteful number, since it uses less digits than its factorization.
141648104752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 521 (or 508 counting only the distinct ones).
The product of its (nonzero) digits is 215040, while the sum is 43.
The spelling of 141648104752 in words is "one hundred forty-one billion, six hundred forty-eight million, one hundred four thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •