Base | Representation |
---|---|
bin | 11111000000010001111… |
… | …100000000001110100000 |
3 | 21112200110111200002221001 |
4 | 133000101330000032200 |
5 | 234401434302033211 |
6 | 4310441501241344 |
7 | 306634241213410 |
oct | 37002174001640 |
9 | 7480414602831 |
10 | 2130604721056 |
11 | 751647902889 |
12 | 2a4b13263254 |
13 | 125bb87c85c6 |
14 | 7519c3b0640 |
15 | 3a64de92ac1 |
hex | 1f011f003a0 |
2130604721056 has 192 divisors, whose sum is σ = 5074542950400. Its totient is φ = 860890567680.
The previous prime is 2130604721017. The next prime is 2130604721083. The reversal of 2130604721056 is 6501274060312.
It is a super-2 number, since 2×21306047210562 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 100551295 + ... + 100572481.
It is an arithmetic number, because the mean of its divisors is an integer number (26429911200).
Almost surely, 22130604721056 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 2130604721056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2537271475200).
2130604721056 is an abundant number, since it is smaller than the sum of its proper divisors (2943938229344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2130604721056 is a wasteful number, since it uses less digits than its factorization.
2130604721056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21507 (or 21499 counting only the distinct ones).
The product of its (nonzero) digits is 60480, while the sum is 37.
Adding to 2130604721056 its reverse (6501274060312), we get a palindrome (8631878781368).
The spelling of 2130604721056 in words is "two trillion, one hundred thirty billion, six hundred four million, seven hundred twenty-one thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •