Base | Representation |
---|---|
bin | 10111001101110001000011… |
… | …110111101001000100000101 |
3 | 111101111202210021221111111011 |
4 | 113031301003313221010011 |
5 | 101340311023403020401 |
6 | 1001052333125442221 |
7 | 30335363316633124 |
oct | 2715610367510405 |
9 | 441452707844434 |
10 | 102101101220101 |
11 | 2a594919961015 |
12 | b54ba64270371 |
13 | 44c81283a6b79 |
14 | 1b2da10a9babb |
15 | bc0d3d50e451 |
hex | 5cdc43de9105 |
102101101220101 has 16 divisors (see below), whose sum is σ = 107555937235200. Its totient is φ = 96654381677568.
The previous prime is 102101101220011. The next prime is 102101101220143. The reversal of 102101101220101 is 101022101101201.
It is a happy number.
It is not a de Polignac number, because 102101101220101 - 231 = 102098953736453 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 (102101101220161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 587616405 + ... + 587790133.
It is an arithmetic number, because the mean of its divisors is an integer number (6722246077200).
Almost surely, 2102101101220101 is an apocalyptic number.
It is an amenable number.
102101101220101 is a deficient number, since it is larger than the sum of its proper divisors (5454836015099).
102101101220101 is a wasteful number, since it uses less digits than its factorization.
102101101220101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 196908.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 102101101220101 its reverse (101022101101201), we get a palindrome (203123202321302).
The spelling of 102101101220101 in words is "one hundred two trillion, one hundred one billion, one hundred one million, two hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •