Base | Representation |
---|---|
bin | 1100010101110101110… |
… | …0010110111000001010 |
3 | 202021021010010110112000 |
4 | 3011131130112320022 |
5 | 11433204401043310 |
6 | 241222352131430 |
7 | 21214036501506 |
oct | 3053534267012 |
9 | 667233113460 |
10 | 212021112330 |
11 | 81a10432885 |
12 | 35111536b76 |
13 | 16cbb9664b1 |
14 | a394837306 |
15 | 57ad9b54c0 |
hex | 315d716e0a |
212021112330 has 64 divisors (see below), whose sum is σ = 566030574720. Its totient is φ = 56474869248.
The previous prime is 212021112307. The next prime is 212021112343. The reversal of 212021112330 is 33211120212.
212021112330 is a `hidden beast` number, since 2 + 120 + 211 + 1 + 2 + 330 = 666.
212021112330 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 206247 + ... + 683066.
It is an arithmetic number, because the mean of its divisors is an integer number (8844227730).
Almost surely, 2212021112330 is an apocalyptic number.
212021112330 is an abundant number, since it is smaller than the sum of its proper divisors (354009462390).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212021112330 is a wasteful number, since it uses less digits than its factorization.
212021112330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 890212 (or 890206 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 212021112330 its reverse (33211120212), we get a palindrome (245232232542).
The spelling of 212021112330 in words is "two hundred twelve billion, twenty-one million, one hundred twelve thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •