Base | Representation |
---|---|
bin | 101101101101000110000101… |
… | …110110001111111111100110 |
3 | 222100201110112220022222221201 |
4 | 231231012011312033333212 |
5 | 202321331022030323420 |
6 | 1551303103322433114 |
7 | 60224365133523355 |
oct | 5555060566177746 |
9 | 870643486288851 |
10 | 201011010011110 |
11 | 59059321894582 |
12 | 1a66534466279a |
13 | 88213455789a0 |
14 | 378cdb03c599c |
15 | 1838b571c110a |
hex | b6d185d8ffe6 |
201011010011110 has 32 divisors (see below), whose sum is σ = 410160117598560. Its totient is φ = 70313163015168.
The previous prime is 201011010011107. The next prime is 201011010011153. The reversal of 201011010011110 is 11110010110102.
It is a super-2 number, since 2×2010110100111102 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 40690485387 + ... + 40690490326.
It is an arithmetic number, because the mean of its divisors is an integer number (12817503674955).
Almost surely, 2201011010011110 is an apocalyptic number.
201011010011110 is an abundant number, since it is smaller than the sum of its proper divisors (209149107587450).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201011010011110 is a wasteful number, since it uses less digits than its factorization.
201011010011110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81380975752.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 201011010011110 its reverse (11110010110102), we get a palindrome (212121020121212).
The spelling of 201011010011110 in words is "two hundred one trillion, eleven billion, ten million, eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •