Base | Representation |
---|---|
bin | 1010000001000011111101… |
… | …1111111111111101100001 |
3 | 1102222212102002200012112211 |
4 | 2200100333133333331201 |
5 | 2420420331021000001 |
6 | 35231245102522121 |
7 | 2214455236102660 |
oct | 240207737777541 |
9 | 42885362605484 |
10 | 11013361500001 |
11 | 35668164a36a3 |
12 | 129a568596341 |
13 | 61b72b677483 |
14 | 2a1099d22dd7 |
15 | 141739717351 |
hex | a043f7fff61 |
11013361500001 has 8 divisors (see below), whose sum is σ = 12590570522304. Its totient is φ = 9437120394000.
The previous prime is 11013361499999. The next prime is 11013361500041. The reversal of 11013361500001 is 10000516331011.
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 11013361500001 - 21 = 11013361499999 is a prime.
It is a super-3 number, since 3×110133615000013 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11013361500041) 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, 241954690 + ... + 242000203.
It is an arithmetic number, because the mean of its divisors is an integer number (1573821315288).
Almost surely, 211013361500001 is an apocalyptic number.
It is an amenable number.
11013361500001 is a deficient number, since it is larger than the sum of its proper divisors (1577209022303).
11013361500001 is an equidigital number, since it uses as much as digits as its factorization.
11013361500001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 483958151.
The product of its (nonzero) digits is 270, while the sum is 22.
Adding to 11013361500001 its reverse (10000516331011), we get a palindrome (21013877831012).
The spelling of 11013361500001 in words is "eleven trillion, thirteen billion, three hundred sixty-one million, five hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •