Base | Representation |
---|---|
bin | 1001010001110010001001… |
… | …0000111110001001110111 |
3 | 1100010012212202010201101101 |
4 | 2110130202100332021313 |
5 | 2314113344240432411 |
6 | 33410155243510531 |
7 | 2102002214015032 |
oct | 224344220761167 |
9 | 40105782121341 |
10 | 10201122202231 |
11 | 32832a95a4384 |
12 | 1189067228447 |
13 | 58cc66accc8c |
14 | 273a4628c019 |
15 | 12a54bb868c1 |
hex | 9472243e277 |
10201122202231 has 16 divisors (see below), whose sum is σ = 10630864893600. Its totient is φ = 9780116646400.
The previous prime is 10201122202217. The next prime is 10201122202277. The reversal of 10201122202231 is 13220222110201.
It is not a de Polignac number, because 10201122202231 - 25 = 10201122202199 is a prime.
It is a super-2 number, since 2×102011222022312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10201122202199 and 10201122202208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10201122200231) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5990571 + ... + 7502611.
It is an arithmetic number, because the mean of its divisors is an integer number (664429055850).
Almost surely, 210201122202231 is an apocalyptic number.
10201122202231 is a deficient number, since it is larger than the sum of its proper divisors (429742691369).
10201122202231 is a wasteful number, since it uses less digits than its factorization.
10201122202231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1514930.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 10201122202231 its reverse (13220222110201), we get a palindrome (23421344312432).
The spelling of 10201122202231 in words is "ten trillion, two hundred one billion, one hundred twenty-two million, two hundred two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •