Base | Representation |
---|---|
bin | 11110001000011101101… |
… | …110110000001101000000 |
3 | 21022221202202121212011210 |
4 | 132020131232300031000 |
5 | 232411214244011000 |
6 | 4223130513210120 |
7 | 302413131236106 |
oct | 36103556601500 |
9 | 7287682555153 |
10 | 2070673032000 |
11 | 729192a42851 |
12 | 295388260940 |
13 | 1203572681c1 |
14 | 72314a1dc76 |
15 | 38ce2735350 |
hex | 1e21dbb0340 |
2070673032000 has 896 divisors, whose sum is σ = 7541087523840. Its totient is φ = 498460262400.
The previous prime is 2070673031989. The next prime is 2070673032019. The reversal of 2070673032000 is 2303760702.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 1102007061 + ... + 1102008939.
Almost surely, 22070673032000 is an apocalyptic number.
2070673032000 is a gapful number since it is divisible by the number (20) 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 2070673032000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3770543761920).
2070673032000 is an abundant number, since it is smaller than the sum of its proper divisors (5470414491840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2070673032000 is a wasteful number, since it uses less digits than its factorization.
2070673032000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2036 (or 2016 counting only the distinct ones).
The product of its (nonzero) digits is 10584, while the sum is 30.
Adding to 2070673032000 its reverse (2303760702), we get a palindrome (2072976792702).
The spelling of 2070673032000 in words is "two trillion, seventy billion, six hundred seventy-three million, thirty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •