Base | Representation |
---|---|
bin | 101101101101000110001100… |
… | …100010101100001101101110 |
3 | 222100201110211201200002201202 |
4 | 231231012030202230031232 |
5 | 202321331234303334314 |
6 | 1551303122414005502 |
7 | 60224400666261230 |
oct | 5555061442541556 |
9 | 870643751602652 |
10 | 201011122324334 |
11 | 5905937a226123 |
12 | 1a6653761a6892 |
13 | 8821362910c0a |
14 | 378cdc12a0250 |
15 | 1838b61ea90de |
hex | b6d18c8ac36e |
201011122324334 has 8 divisors (see below), whose sum is σ = 344590495413168. Its totient is φ = 86147623853280.
The previous prime is 201011122324141. The next prime is 201011122324357. The reversal of 201011122324334 is 433423221110102.
It is a happy number.
201011122324334 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 201011122324297 and 201011122324306.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7178968654427 + ... + 7178968654454.
It is an arithmetic number, because the mean of its divisors is an integer number (43073811926646).
Almost surely, 2201011122324334 is an apocalyptic number.
201011122324334 is a deficient number, since it is larger than the sum of its proper divisors (143579373088834).
201011122324334 is a wasteful number, since it uses less digits than its factorization.
201011122324334 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14357937308890.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 201011122324334 its reverse (433423221110102), we get a palindrome (634434343434436).
The spelling of 201011122324334 in words is "two hundred one trillion, eleven billion, one hundred twenty-two million, three hundred twenty-four thousand, three hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •