Base | Representation |
---|---|
bin | 11111000001100110010… |
… | …010111010100100000000 |
3 | 21112211010010210101220202 |
4 | 133001212102322210000 |
5 | 234412334110411222 |
6 | 4311234140024332 |
7 | 310014305050040 |
oct | 37014622724400 |
9 | 7484103711822 |
10 | 2132020013312 |
11 | 752203796902 |
12 | 2a52492320a8 |
13 | 126082a9c747 |
14 | 75294343720 |
15 | 3a6d3358892 |
hex | 1f0664ba900 |
2132020013312 has 144 divisors (see below), whose sum is σ = 5216254968960. Its totient is φ = 849298784256.
The previous prime is 2132020013287. The next prime is 2132020013327. The reversal of 2132020013312 is 2133100202312.
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 15 ways as a sum of consecutive naturals, for example, 1213808 + ... + 2395280.
It is an arithmetic number, because the mean of its divisors is an integer number (36223992840).
Almost surely, 22132020013312 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 2132020013312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2608127484480).
2132020013312 is an abundant number, since it is smaller than the sum of its proper divisors (3084234955648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2132020013312 is a wasteful number, since it uses less digits than its factorization.
2132020013312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1181568 (or 1181554 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 2132020013312 its reverse (2133100202312), we get a palindrome (4265120215624).
The spelling of 2132020013312 in words is "two trillion, one hundred thirty-two billion, twenty million, thirteen thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •