Base | Representation |
---|---|
bin | 1010010001110000101011… |
… | …0111101000101010010001 |
3 | 1111000021220020122122102212 |
4 | 2210130022313220222101 |
5 | 2440120343233444101 |
6 | 40011131552521505 |
7 | 2244262341215456 |
oct | 244341267505221 |
9 | 44007806578385 |
10 | 11300241312401 |
11 | 3667450695848 |
12 | 132608bb50295 |
13 | 63c7ba242c62 |
14 | 2b0d1277182d |
15 | 148e2a1331bb |
hex | a470ade8a91 |
11300241312401 has 2 divisors, whose sum is σ = 11300241312402. Its totient is φ = 11300241312400.
The previous prime is 11300241312397. The next prime is 11300241312403. The reversal of 11300241312401 is 10421314200311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8821191062401 + 2479050250000 = 2970049^2 + 1574500^2 .
It is a cyclic number.
It is not a de Polignac number, because 11300241312401 - 22 = 11300241312397 is a prime.
It is a Sophie Germain prime.
Together with 11300241312403, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (11300241312403) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5650120656200 + 5650120656201.
It is an arithmetic number, because the mean of its divisors is an integer number (5650120656201).
Almost surely, 211300241312401 is an apocalyptic number.
It is an amenable number.
11300241312401 is a deficient number, since it is larger than the sum of its proper divisors (1).
11300241312401 is an equidigital number, since it uses as much as digits as its factorization.
11300241312401 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 11300241312401 its reverse (10421314200311), we get a palindrome (21721555512712).
The spelling of 11300241312401 in words is "eleven trillion, three hundred billion, two hundred forty-one million, three hundred twelve thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •