Base | Representation |
---|---|
bin | 101111000010101000… |
… | …1111010011000001101 |
3 | 100122202021112121200211 |
4 | 1132011101322120031 |
5 | 3123342200004401 |
6 | 114224051522421 |
7 | 10204243331161 |
oct | 1360521723015 |
9 | 318667477624 |
10 | 101020313101 |
11 | 3992a373474 |
12 | 176b35b9411 |
13 | 96ac00c6c6 |
14 | 4c64778ca1 |
15 | 2963ace951 |
hex | 178547a60d |
101020313101 has 4 divisors (see below), whose sum is σ = 103369622752. Its totient is φ = 98671003452.
The previous prime is 101020313057. The next prime is 101020313111. The reversal of 101020313101 is 101313020101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 101313020101 = 53 ⋅1911566417.
It is a cyclic number.
It is not a de Polignac number, because 101020313101 - 231 = 98872829453 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 (101020313111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1174654761 + ... + 1174654846.
It is an arithmetic number, because the mean of its divisors is an integer number (25842405688).
Almost surely, 2101020313101 is an apocalyptic number.
It is an amenable number.
101020313101 is a deficient number, since it is larger than the sum of its proper divisors (2349309651).
101020313101 is an equidigital number, since it uses as much as digits as its factorization.
101020313101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2349309650.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 101020313101 its reverse (101313020101), we get a palindrome (202333333202).
The spelling of 101020313101 in words is "one hundred one billion, twenty million, three hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •