Base | Representation |
---|---|
bin | 10110111111010110000010… |
… | …010010011111100100001101 |
3 | 111021000000121111211211211000 |
4 | 112333112002102133210031 |
5 | 101223041300304013401 |
6 | 555013144154450513 |
7 | 30203646221031024 |
oct | 2677260222374415 |
9 | 437000544754730 |
10 | 101110011001101 |
11 | 2a2425733064a3 |
12 | b40b96a133a39 |
13 | 445582cc90abb |
14 | 1ad7a71aa38bb |
15 | ba51840a3186 |
hex | 5bf58249f90d |
101110011001101 has 8 divisors (see below), whose sum is σ = 149792608890560. Its totient is φ = 67406674000716.
The previous prime is 101110011001061. The next prime is 101110011001187. The reversal of 101110011001101 is 101100110011101.
It is not a de Polignac number, because 101110011001101 - 242 = 96711964489997 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101110011001801) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1872407611105 + ... + 1872407611158.
It is an arithmetic number, because the mean of its divisors is an integer number (18724076111320).
Almost surely, 2101110011001101 is an apocalyptic number.
It is an amenable number.
101110011001101 is a deficient number, since it is larger than the sum of its proper divisors (48682597889459).
101110011001101 is an equidigital number, since it uses as much as digits as its factorization.
101110011001101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3744815222272 (or 3744815222266 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 101110011001101 its reverse (101100110011101), we get a palindrome (202210121012202).
The spelling of 101110011001101 in words is "one hundred one trillion, one hundred ten billion, eleven million, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •