Base | Representation |
---|---|
bin | 1000001101111111100… |
… | …0001100101011000000 |
3 | 111111110010022101220010 |
4 | 2003133320030223000 |
5 | 4303131410121413 |
6 | 144510350544520 |
7 | 13125641510520 |
oct | 2033770145300 |
9 | 444403271803 |
10 | 141195004608 |
11 | 54975998859 |
12 | 23445b08140 |
13 | 10412327808 |
14 | 6b9621b680 |
15 | 3a15ac1dc3 |
hex | 20dfe0cac0 |
141195004608 has 448 divisors, whose sum is σ = 467049185280. Its totient is φ = 36735897600.
The previous prime is 141195004583. The next prime is 141195004609. The reversal of 141195004608 is 806400591141.
It is a tau number, because it is divible by the number of its divisors (448).
It is not an unprimeable number, because it can be changed into a prime (141195004609) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 136949053 + ... + 136950083.
Almost surely, 2141195004608 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 141195004608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (233524592640).
141195004608 is an abundant number, since it is smaller than the sum of its proper divisors (325854180672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141195004608 is a wasteful number, since it uses less digits than its factorization.
141195004608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1276 (or 1266 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 39.
Adding to 141195004608 its reverse (806400591141), we get a palindrome (947595595749).
The spelling of 141195004608 in words is "one hundred forty-one billion, one hundred ninety-five million, four thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •