Base | Representation |
---|---|
bin | 11011100101110110001… |
… | …111110011000000000000 |
3 | 20201021001222201211201111 |
4 | 123211312033303000000 |
5 | 222031114443230310 |
6 | 4011012345013104 |
7 | 253662146510542 |
oct | 33456617630000 |
9 | 6637058654644 |
10 | 1896064430080 |
11 | 671130a38867 |
12 | 267578184194 |
13 | 109a4b5a1742 |
14 | 67aacc8b692 |
15 | 344c34e828a |
hex | 1b9763f3000 |
1896064430080 has 312 divisors, whose sum is σ = 4688068393440. Its totient is φ = 735962726400.
The previous prime is 1896064430053. The next prime is 1896064430081. The reversal of 1896064430080 is 800344606981.
It is not an unprimeable number, because it can be changed into a prime (1896064430081) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 12556718005 + ... + 12556718155.
Almost surely, 21896064430080 is an apocalyptic number.
1896064430080 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1896064430080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2344034196720).
1896064430080 is an abundant number, since it is smaller than the sum of its proper divisors (2792003963360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1896064430080 is an frugal number, since it uses more digits than its factorization.
1896064430080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 435 (or 330 counting only the distinct ones).
The product of its (nonzero) digits is 995328, while the sum is 49.
The spelling of 1896064430080 in words is "one trillion, eight hundred ninety-six billion, sixty-four million, four hundred thirty thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •