Base | Representation |
---|---|
bin | 101111000101100111… |
… | …0100101001110001111 |
3 | 100200000020022111010112 |
4 | 1132023032211032033 |
5 | 3124043221301221 |
6 | 114242014430235 |
7 | 10206564460553 |
oct | 1361316451617 |
9 | 320006274115 |
10 | 101120103311 |
11 | 39980731317 |
12 | 17720b0237b |
13 | 96c68ab876 |
14 | 4c73b13863 |
15 | 296c74215b |
hex | 178b3a538f |
101120103311 has 4 divisors (see below), whose sum is σ = 101120811624. Its totient is φ = 101119395000.
The previous prime is 101120103289. The next prime is 101120103347. The reversal of 101120103311 is 113301021101.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 113301021101 = 613 ⋅184830377.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101120103311 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 (101120103361) 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, 56780 + ... + 453281.
It is an arithmetic number, because the mean of its divisors is an integer number (25280202906).
Almost surely, 2101120103311 is an apocalyptic number.
101120103311 is a deficient number, since it is larger than the sum of its proper divisors (708313).
101120103311 is an equidigital number, since it uses as much as digits as its factorization.
101120103311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 708312.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 101120103311 its reverse (113301021101), we get a palindrome (214421124412).
The spelling of 101120103311 in words is "one hundred one billion, one hundred twenty million, one hundred three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •