Base | Representation |
---|---|
bin | 110100111000001001… |
… | …0101111100000111101 |
3 | 101212002201012201111112 |
4 | 1221300102233200331 |
5 | 3330024044023401 |
6 | 124055433131405 |
7 | 11126644342643 |
oct | 1516022574075 |
9 | 355081181445 |
10 | 113553111101 |
11 | 44180853071 |
12 | 1a010859b65 |
13 | a928670a01 |
14 | 56d3049193 |
15 | 2e48ee63bb |
hex | 1a704af83d |
113553111101 has 8 divisors (see below), whose sum is σ = 118614559680. Its totient is φ = 108502025632.
The previous prime is 113553111097. The next prime is 113553111131. The reversal of 113553111101 is 101111355311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 113553111101 - 22 = 113553111097 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113553111131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2568371 + ... + 2612208.
It is an arithmetic number, because the mean of its divisors is an integer number (14826819960).
Almost surely, 2113553111101 is an apocalyptic number.
It is an amenable number.
113553111101 is a deficient number, since it is larger than the sum of its proper divisors (5061448579).
113553111101 is an equidigital number, since it uses as much as digits as its factorization.
113553111101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5181555.
The product of its (nonzero) digits is 225, while the sum is 23.
Adding to 113553111101 its reverse (101111355311), we get a palindrome (214664466412).
The spelling of 113553111101 in words is "one hundred thirteen billion, five hundred fifty-three million, one hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •