Base | Representation |
---|---|
bin | 1010000001000010111111… |
… | …1011100110100000100001 |
3 | 1102222211201220011212221121 |
4 | 2200100233323212200201 |
5 | 2420414312134102241 |
6 | 35231203132252241 |
7 | 2214445614663610 |
oct | 240205773464041 |
9 | 42884656155847 |
10 | 11013100300321 |
11 | 35666a2010499 |
12 | 129a4b5011081 |
13 | 61b6b9513152 |
14 | 2a107336d877 |
15 | 14172181ead1 |
hex | a042fee6821 |
11013100300321 has 32 divisors (see below), whose sum is σ = 12712144896000. Its totient is φ = 9345877517952.
The previous prime is 11013100300303. The next prime is 11013100300357. The reversal of 11013100300321 is 12300300131011.
It is a cyclic number.
It is not a de Polignac number, because 11013100300321 - 217 = 11013100169249 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11013100300295 and 11013100300304.
It is not an unprimeable number, because it can be changed into a prime (11013100300381) 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 31 ways as a sum of consecutive naturals, for example, 1953020820 + ... + 1953026458.
It is an arithmetic number, because the mean of its divisors is an integer number (397254528000).
Almost surely, 211013100300321 is an apocalyptic number.
It is an amenable number.
11013100300321 is a deficient number, since it is larger than the sum of its proper divisors (1699044595679).
11013100300321 is a wasteful number, since it uses less digits than its factorization.
11013100300321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10861.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 11013100300321 its reverse (12300300131011), we get a palindrome (23313400431332).
The spelling of 11013100300321 in words is "eleven trillion, thirteen billion, one hundred million, three hundred thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •