Base | Representation |
---|---|
bin | 1010001011111011010111… |
… | …0011110100001110001101 |
3 | 1110122201020100101112002102 |
4 | 2202332311303310032031 |
5 | 2432000130140000023 |
6 | 35453120040404445 |
7 | 2234114120136041 |
oct | 242766563641615 |
9 | 43581210345072 |
10 | 11200030000013 |
11 | 36289a6a50608 |
12 | 130a783476725 |
13 | 633209a181ca |
14 | 2aa127626021 |
15 | 1465125a7628 |
hex | a2fb5cf438d |
11200030000013 has 8 divisors (see below), whose sum is σ = 11561599630080. Its totient is φ = 10838477766240.
The previous prime is 11200029999953. The next prime is 11200030000043. The reversal of 11200030000013 is 31000003000211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11200030000013 - 216 = 11200029934477 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11200029999949 and 11200030000003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11200030000043) 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, 3034343 + ... + 5622036.
It is an arithmetic number, because the mean of its divisors is an integer number (1445199953760).
Almost surely, 211200030000013 is an apocalyptic number.
It is an amenable number.
11200030000013 is a deficient number, since it is larger than the sum of its proper divisors (361569630067).
11200030000013 is an equidigital number, since it uses as much as digits as its factorization.
11200030000013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8698147.
The product of its (nonzero) digits is 18, while the sum is 11.
Adding to 11200030000013 its reverse (31000003000211), we get a palindrome (42200033000224).
The spelling of 11200030000013 in words is "eleven trillion, two hundred billion, thirty million, thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •