Base | Representation |
---|---|
bin | 10110111111100000011110… |
… | …011001110110011110001100 |
3 | 111021001002112200202120211121 |
4 | 112333200132121312132030 |
5 | 101223232224322011340 |
6 | 555022240332530324 |
7 | 30204524046630322 |
oct | 2677403631663614 |
9 | 437032480676747 |
10 | 101121220110220 |
11 | 2a2472a5589042 |
12 | b411b780209a4 |
13 | 44568c831194b |
14 | 1ad8416647d12 |
15 | ba55dd19a94a |
hex | 5bf81e67678c |
101121220110220 has 48 divisors (see below), whose sum is σ = 215983676311200. Its totient is φ = 39762825467904.
The previous prime is 101121220110121. The next prime is 101121220110263. The reversal of 101121220110220 is 22011022121101.
It is a junction number, because it is equal to n+sod(n) for n = 101121220110194 and 101121220110203.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 174624834 + ... + 175202953.
It is an arithmetic number, because the mean of its divisors is an integer number (4499659923150).
Almost surely, 2101121220110220 is an apocalyptic number.
101121220110220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101121220110220 is an abundant number, since it is smaller than the sum of its proper divisors (114862456200980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101121220110220 is a wasteful number, since it uses less digits than its factorization.
101121220110220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 349828042 (or 349828040 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 101121220110220 its reverse (22011022121101), we get a palindrome (123132242231321).
The spelling of 101121220110220 in words is "one hundred one trillion, one hundred twenty-one billion, two hundred twenty million, one hundred ten thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •