Base | Representation |
---|---|
bin | 1010000111010010011010… |
… | …1111000111000001101110 |
3 | 1110101002111020100210121101 |
4 | 2201310212233013001232 |
5 | 2424143403433304402 |
6 | 35352334331153314 |
7 | 2225262621132532 |
oct | 241644657070156 |
9 | 43332436323541 |
10 | 11120320213102 |
11 | 35a8112943961 |
12 | 12b72388a583a |
13 | 628845a65619 |
14 | 2a6325233bc2 |
15 | 1443e9812b87 |
hex | a1d26bc706e |
11120320213102 has 8 divisors (see below), whose sum is σ = 16680732136056. Its totient is φ = 5560076167752.
The previous prime is 11120320213099. The next prime is 11120320213103. The reversal of 11120320213102 is 20131202302111.
11120320213102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 11120320213102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11120320213103) 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, 41803668 + ... + 42068839.
It is an arithmetic number, because the mean of its divisors is an integer number (2085091517007).
Almost surely, 211120320213102 is an apocalyptic number.
11120320213102 is a deficient number, since it is larger than the sum of its proper divisors (5560411922954).
11120320213102 is an equidigital number, since it uses as much as digits as its factorization.
11120320213102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 83938802.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 11120320213102 its reverse (20131202302111), we get a palindrome (31251522515213).
The spelling of 11120320213102 in words is "eleven trillion, one hundred twenty billion, three hundred twenty million, two hundred thirteen thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •