Base | Representation |
---|---|
bin | 1100001110011011110… |
… | …0010110010101011100 |
3 | 202002010120011101211211 |
4 | 3003212330112111130 |
5 | 11420121422310022 |
6 | 240253212154204 |
7 | 21113546062030 |
oct | 3034674262534 |
9 | 662116141754 |
10 | 210033010012 |
11 | 81090182111 |
12 | 34857768964 |
13 | 16a62ac66a7 |
14 | a2467981c0 |
15 | 56e41a2e77 |
hex | 30e6f1655c |
210033010012 has 72 divisors (see below), whose sum is σ = 444160558464. Its totient is φ = 85118421024.
The previous prime is 210033010001. The next prime is 210033010021. The reversal of 210033010012 is 210010330012.
It is a super-3 number, since 3×2100330100123 (a number of 35 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 210033009974 and 210033010001.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5510083 + ... + 5548069.
Almost surely, 2210033010012 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 210033010012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (222080279232).
210033010012 is an abundant number, since it is smaller than the sum of its proper divisors (234127548452).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210033010012 is a wasteful number, since it uses less digits than its factorization.
210033010012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38583 (or 38562 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 210033010012 its reverse (210010330012), we get a palindrome (420043340024).
The spelling of 210033010012 in words is "two hundred ten billion, thirty-three million, ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •