Base | Representation |
---|---|
bin | 1010010010001011001001… |
… | …1011011111010000001101 |
3 | 1111000222020111011000202202 |
4 | 2210202302123133100031 |
5 | 2440224421423122141 |
6 | 40014305042331245 |
7 | 2244633416460206 |
oct | 244426233372015 |
9 | 44028214130682 |
10 | 11307347473421 |
11 | 366a46795979a |
12 | 1327533959b25 |
13 | 640380538a6c |
14 | 2b13c84445ad |
15 | 1491e3e1c49b |
hex | a48b26df40d |
11307347473421 has 2 divisors, whose sum is σ = 11307347473422. Its totient is φ = 11307347473420.
The previous prime is 11307347473417. The next prime is 11307347473423. The reversal of 11307347473421 is 12437474370311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9068463709321 + 2238883764100 = 3011389^2 + 1496290^2 .
It is a cyclic number.
It is not a de Polignac number, because 11307347473421 - 22 = 11307347473417 is a prime.
It is a super-2 number, since 2×113073474734212 (a number of 27 digits) contains 22 as substring.
Together with 11307347473423, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11307347473423) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5653673736710 + 5653673736711.
It is an arithmetic number, because the mean of its divisors is an integer number (5653673736711).
Almost surely, 211307347473421 is an apocalyptic number.
It is an amenable number.
11307347473421 is a deficient number, since it is larger than the sum of its proper divisors (1).
11307347473421 is an equidigital number, since it uses as much as digits as its factorization.
11307347473421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1185408, while the sum is 47.
The spelling of 11307347473421 in words is "eleven trillion, three hundred seven billion, three hundred forty-seven million, four hundred seventy-three thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •