Base | Representation |
---|---|
bin | 101101101101000110000110… |
… | …100100000100101000110110 |
3 | 222100201110120201221021110202 |
4 | 231231012012210010220312 |
5 | 202321331033114220342 |
6 | 1551303104432120502 |
7 | 60224365340603165 |
oct | 5555060644045066 |
9 | 870643521837422 |
10 | 201011022023222 |
11 | 59059328649444 |
12 | 1a665348696132 |
13 | 8821347bc3348 |
14 | 378cdb1c313dc |
15 | 1838b58295332 |
hex | b6d186904a36 |
201011022023222 has 4 divisors (see below), whose sum is σ = 301516533034836. Its totient is φ = 100505511011610.
The previous prime is 201011022023221. The next prime is 201011022023263. The reversal of 201011022023222 is 222320220110102.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×2010110220232222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201011022023194 and 201011022023203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201011022023221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50252755505804 + ... + 50252755505807.
It is an arithmetic number, because the mean of its divisors is an integer number (75379133258709).
Almost surely, 2201011022023222 is an apocalyptic number.
201011022023222 is a deficient number, since it is larger than the sum of its proper divisors (100505511011614).
201011022023222 is a wasteful number, since it uses less digits than its factorization.
201011022023222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100505511011613.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 201011022023222 its reverse (222320220110102), we get a palindrome (423331242133324).
The spelling of 201011022023222 in words is "two hundred one trillion, eleven billion, twenty-two million, twenty-three thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •