Base | Representation |
---|---|
bin | 10110111111001100111010… |
… | …110100110011001000101010 |
3 | 111020222002100022022010221202 |
4 | 112333030322310303020222 |
5 | 101222411223324200020 |
6 | 555004444552404202 |
7 | 30203151515530550 |
oct | 2677147264631052 |
9 | 436862308263852 |
10 | 101100222100010 |
11 | 2a2393aa7751a1 |
12 | b409a979a6662 |
13 | 445492cc45733 |
14 | 1ad73c39b1bd0 |
15 | ba4cae9e2e75 |
hex | 5bf33ad3322a |
101100222100010 has 64 divisors (see below), whose sum is σ = 213941649116160. Its totient is φ = 33675999866880.
The previous prime is 101100222099997. The next prime is 101100222100021. The reversal of 101100222100010 is 10001222001101.
It is a super-5 number, since 5×1011002221000105 (a number of 71 digits) contains 55555 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101100222099964 and 101100222100000.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 73009799 + ... + 74381658.
It is an arithmetic number, because the mean of its divisors is an integer number (3342838267440).
Almost surely, 2101100222100010 is an apocalyptic number.
101100222100010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101100222100010 is an abundant number, since it is smaller than the sum of its proper divisors (112841427016150).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101100222100010 is a wasteful number, since it uses less digits than its factorization.
101100222100010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 147391751.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 101100222100010 its reverse (10001222001101), we get a palindrome (111101444101111).
The spelling of 101100222100010 in words is "one hundred one trillion, one hundred billion, two hundred twenty-two million, one hundred thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •