Base | Representation |
---|---|
bin | 110000010001101010100111… |
… | …111010000100111010010000 |
3 | 1000211202121121220120102201110 |
4 | 300101222213322010322100 |
5 | 210312123312431030000 |
6 | 2031322322310533320 |
7 | 62502426144245502 |
oct | 6021524772047220 |
9 | 1024677556512643 |
10 | 212320230330000 |
11 | 6171955a931841 |
12 | 1b9910bb667240 |
13 | 9161933acb520 |
14 | 3a604d5465d72 |
15 | 1982e0a735850 |
hex | c11aa7e84e90 |
212320230330000 has 800 divisors, whose sum is σ = 741147531772032. Its totient is φ = 52049664000000.
The previous prime is 212320230329989. The next prime is 212320230330083. The reversal of 212320230330000 is 33032023212.
It is an unprimeable number.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 146326829275 + ... + 146326830725.
Almost surely, 2212320230330000 is an apocalyptic number.
212320230330000 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 212320230330000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (370573765886016).
212320230330000 is an abundant number, since it is smaller than the sum of its proper divisors (528827301442032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212320230330000 is a wasteful number, since it uses less digits than its factorization.
212320230330000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2773 (or 2752 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 212320230330000 its reverse (33032023212), we get a palindrome (212353262353212).
The spelling of 212320230330000 in words is "two hundred twelve trillion, three hundred twenty billion, two hundred thirty million, three hundred thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •