Base | Representation |
---|---|
bin | 1010000001000010111111… |
… | …1011100110100001000101 |
3 | 1102222211201220011212222221 |
4 | 2200100233323212201011 |
5 | 2420414312134102412 |
6 | 35231203132252341 |
7 | 2214445614663661 |
oct | 240205773464105 |
9 | 42884656155887 |
10 | 11013100300357 |
11 | 35666a2010521 |
12 | 129a4b50110b1 |
13 | 61b6b951317c |
14 | 2a107336d8a1 |
15 | 14172181eb07 |
hex | a042fee6845 |
11013100300357 has 2 divisors, whose sum is σ = 11013100300358. Its totient is φ = 11013100300356.
The previous prime is 11013100300303. The next prime is 11013100300369. The reversal of 11013100300357 is 75300300131011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10302360253441 + 710740046916 = 3209729^2 + 843054^2 .
It is a cyclic number.
It is not a de Polignac number, because 11013100300357 - 27 = 11013100300229 is a prime.
It is a super-2 number, since 2×110131003003572 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11013100306357) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5506550150178 + 5506550150179.
It is an arithmetic number, because the mean of its divisors is an integer number (5506550150179).
Almost surely, 211013100300357 is an apocalyptic number.
It is an amenable number.
11013100300357 is a deficient number, since it is larger than the sum of its proper divisors (1).
11013100300357 is an equidigital number, since it uses as much as digits as its factorization.
11013100300357 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 945, while the sum is 25.
Adding to 11013100300357 its reverse (75300300131011), we get a palindrome (86313400431368).
The spelling of 11013100300357 in words is "eleven trillion, thirteen billion, one hundred million, three hundred thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •