Base | Representation |
---|---|
bin | 10110111111001101001101… |
… | …001100001100111111001101 |
3 | 111020222010010210002112010011 |
4 | 112333031031030030333031 |
5 | 101222412341214200401 |
6 | 555004535320513221 |
7 | 30203162246540461 |
oct | 2677151514147715 |
9 | 436863123075104 |
10 | 101100530225101 |
11 | 2a239548699130 |
12 | b409b6301b811 |
13 | 445497ba29884 |
14 | 1ad741289c4a1 |
15 | ba4ccbaa9451 |
hex | 5bf34d30cfcd |
101100530225101 has 16 divisors (see below), whose sum is σ = 111859833765888. Its totient is φ = 90602963676400.
The previous prime is 101100530225099. The next prime is 101100530225153. The reversal of 101100530225101 is 101522035001101.
It is a cyclic number.
It is not a de Polignac number, because 101100530225101 - 21 = 101100530225099 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101100530225161) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2797645 + ... + 14492338.
It is an arithmetic number, because the mean of its divisors is an integer number (6991239610368).
Almost surely, 2101100530225101 is an apocalyptic number.
101100530225101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101100530225101 is a deficient number, since it is larger than the sum of its proper divisors (10759303540787).
101100530225101 is a wasteful number, since it uses less digits than its factorization.
101100530225101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17297552.
The product of its (nonzero) digits is 300, while the sum is 22.
Adding to 101100530225101 its reverse (101522035001101), we get a palindrome (202622565226202).
The spelling of 101100530225101 in words is "one hundred one trillion, one hundred billion, five hundred thirty million, two hundred twenty-five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •