Base | Representation |
---|---|
bin | 1100001110110001000… |
… | …1000101110000011101 |
3 | 202002100210020111020112 |
4 | 3003230101011300131 |
5 | 11420312304130323 |
6 | 240310122455405 |
7 | 21116012235362 |
oct | 3035421056035 |
9 | 662323214215 |
10 | 210122333213 |
11 | 81126640a41 |
12 | 34881664565 |
13 | 16a7846c560 |
14 | a2545aa469 |
15 | 56ebe49178 |
hex | 30ec445c1d |
210122333213 has 16 divisors (see below), whose sum is σ = 234219274800. Its totient is φ = 187166246400.
The previous prime is 210122333189. The next prime is 210122333219. The reversal of 210122333213 is 312333221012.
It can be written as a sum of positive squares in 8 ways, for example, as 945993049 + 209176340164 = 30757^2 + 457358^2 .
It is a cyclic number.
It is not a de Polignac number, because 210122333213 - 28 = 210122332957 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210122333219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 524243 + ... + 833711.
It is an arithmetic number, because the mean of its divisors is an integer number (14638704675).
Almost surely, 2210122333213 is an apocalyptic number.
It is an amenable number.
210122333213 is a deficient number, since it is larger than the sum of its proper divisors (24096941587).
210122333213 is a wasteful number, since it uses less digits than its factorization.
210122333213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 311312.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 210122333213 its reverse (312333221012), we get a palindrome (522455554225).
The spelling of 210122333213 in words is "two hundred ten billion, one hundred twenty-two million, three hundred thirty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •