Base | Representation |
---|---|
bin | 1011101100110111001… |
… | …1000110110101010111 |
3 | 201012212111220011001000 |
4 | 2323031303012311113 |
5 | 11243142413102411 |
6 | 232203050234343 |
7 | 20344331124204 |
oct | 2731563066527 |
9 | 635774804030 |
10 | 201021222231 |
11 | 7828626a615 |
12 | 32b617259b3 |
13 | 15c57a79b9b |
14 | 9a2d994cab |
15 | 5367e48956 |
hex | 2ecdcc6d57 |
201021222231 has 48 divisors (see below), whose sum is σ = 301592712960. Its totient is φ = 132332220000.
The previous prime is 201021222223. The next prime is 201021222263. The reversal of 201021222231 is 132222120102.
201021222231 is a `hidden beast` number, since 201 + 0 + 212 + 22 + 231 = 666.
It is not a de Polignac number, because 201021222231 - 23 = 201021222223 is a prime.
It is a super-2 number, since 2×2010212222312 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201021222211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 138539056 + ... + 138540506.
It is an arithmetic number, because the mean of its divisors is an integer number (6283181520).
Almost surely, 2201021222231 is an apocalyptic number.
201021222231 is a deficient number, since it is larger than the sum of its proper divisors (100571490729).
201021222231 is a wasteful number, since it uses less digits than its factorization.
201021222231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2165 (or 2058 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 201021222231 its reverse (132222120102), we get a palindrome (333243342333).
The spelling of 201021222231 in words is "two hundred one billion, twenty-one million, two hundred twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •