Base | Representation |
---|---|
bin | 10110111111001101101111… |
… | …001101100101010011110010 |
3 | 111020222011121120010111211110 |
4 | 112333031233031211103302 |
5 | 101222420023324342320 |
6 | 555005112110454150 |
7 | 30203212350260025 |
oct | 2677155715452362 |
9 | 436864546114743 |
10 | 101101101012210 |
11 | 2a239810903a12 |
12 | b40a0a2204356 |
13 | 4454a40067820 |
14 | 1ad74685dd1bc |
15 | ba4d11c565e0 |
hex | 5bf36f3654f2 |
101101101012210 has 128 divisors (see below), whose sum is σ = 284545330272000. Its totient is φ = 22763626324992.
The previous prime is 101101101012199. The next prime is 101101101012227. The reversal of 101101101012210 is 12210101101101.
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 63 ways as a sum of consecutive naturals, for example, 235024305 + ... + 235454084.
It is an arithmetic number, because the mean of its divisors is an integer number (2223010392750).
Almost surely, 2101101101012210 is an apocalyptic number.
101101101012210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101101101012210 is an abundant number, since it is smaller than the sum of its proper divisors (183444229259790).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101101101012210 is a wasteful number, since it uses less digits than its factorization.
101101101012210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 470478460.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 101101101012210 its reverse (12210101101101), we get a palindrome (113311202113311).
The spelling of 101101101012210 in words is "one hundred one trillion, one hundred one billion, one hundred one million, twelve thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •