Base | Representation |
---|---|
bin | 101000101000011… |
… | …1101010101010101 |
3 | 10112000110220020002 |
4 | 1101100331111111 |
5 | 10243012300041 |
6 | 343142221045 |
7 | 45533465114 |
oct | 12120752525 |
9 | 3460426202 |
10 | 1363400021 |
11 | 63a670685 |
12 | 320724785 |
13 | 189605699 |
14 | cd105c7b |
15 | 7ea6559b |
hex | 5143d555 |
1363400021 has 2 divisors, whose sum is σ = 1363400022. Its totient is φ = 1363400020.
The previous prime is 1363399993. The next prime is 1363400023. The reversal of 1363400021 is 1200043631.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1186802500 + 176597521 = 34450^2 + 13289^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1363400021 is a prime.
Together with 1363400023, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 1363399966 and 1363400002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1363400023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 681700010 + 681700011.
It is an arithmetic number, because the mean of its divisors is an integer number (681700011).
Almost surely, 21363400021 is an apocalyptic number.
It is an amenable number.
1363400021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1363400021 is an equidigital number, since it uses as much as digits as its factorization.
1363400021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
The square root of 1363400021 is about 36924.2470607052. The cubic root of 1363400021 is about 1108.8541650900.
Adding to 1363400021 its reverse (1200043631), we get a palindrome (2563443652).
The spelling of 1363400021 in words is "one billion, three hundred sixty-three million, four hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •