Base | Representation |
---|---|
bin | 1010000110001010110111… |
… | …1010001011011001111110 |
3 | 1110022020220122222120001000 |
4 | 2201202231322023121332 |
5 | 2423340034434433202 |
6 | 35335440410231130 |
7 | 2224012635212514 |
oct | 241425572133176 |
9 | 43266818876030 |
10 | 11101113202302 |
11 | 359aa56aa7412 |
12 | 12b35784254a6 |
13 | 626aa4757786 |
14 | 2a54223b04b4 |
15 | 143b734d691c |
hex | a18ade8b67e |
11101113202302 has 16 divisors (see below), whose sum is σ = 24669140449680. Its totient is φ = 3700371067416.
The previous prime is 11101113202301. The next prime is 11101113202327. The reversal of 11101113202302 is 20320231110111.
11101113202302 is a `hidden beast` number, since 1 + 1 + 1 + 0 + 111 + 320 + 230 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11101113202301) 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, 102788085153 + ... + 102788085260.
It is an arithmetic number, because the mean of its divisors is an integer number (1541821278105).
Almost surely, 211101113202302 is an apocalyptic number.
11101113202302 is an abundant number, since it is smaller than the sum of its proper divisors (13568027247378).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11101113202302 is a wasteful number, since it uses less digits than its factorization.
11101113202302 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 205576170424 (or 205576170418 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 11101113202302 its reverse (20320231110111), we get a palindrome (31421344312413).
The spelling of 11101113202302 in words is "eleven trillion, one hundred one billion, one hundred thirteen million, two hundred two thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •