Base | Representation |
---|---|
bin | 11111001111110010110… |
… | …001000111010100010000 |
3 | 21121021110100121100211222 |
4 | 133033302301013110100 |
5 | 240140042440021000 |
6 | 4322234405024212 |
7 | 311064100544216 |
oct | 37176261072420 |
9 | 7537410540758 |
10 | 2147261642000 |
11 | 758715244052 |
12 | 2a81a16b5068 |
13 | 1276416b9a47 |
14 | 75cdc6a4cb6 |
15 | 3acc649ba85 |
hex | 1f3f2c47510 |
2147261642000 has 80 divisors (see below), whose sum is σ = 5205779904000. Its totient is φ = 856638115200.
The previous prime is 2147261641999. The next prime is 2147261642003. The reversal of 2147261642000 is 2461627412.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×21472616420002 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2147261642003) 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, 658400 + ... + 2174399.
It is an arithmetic number, because the mean of its divisors is an integer number (65072248800).
Almost surely, 22147261642000 is an apocalyptic number.
2147261642000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2147261642000 is an abundant number, since it is smaller than the sum of its proper divisors (3058518262000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2147261642000 is a wasteful number, since it uses less digits than its factorization.
2147261642000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2833201 (or 2833185 counting only the distinct ones).
The product of its (nonzero) digits is 32256, while the sum is 35.
The spelling of 2147261642000 in words is "two trillion, one hundred forty-seven billion, two hundred sixty-one million, six hundred forty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •