Base | Representation |
---|---|
bin | 10100011000110101010… |
… | …101001100011010100101 |
3 | 11221221100212102221202111 |
4 | 110120311111030122211 |
5 | 140423324321234241 |
6 | 2551345123241021 |
7 | 203136266146324 |
oct | 24306525143245 |
9 | 4857325387674 |
10 | 1401054086821 |
11 | 4a0202563324 |
12 | 1a764a219171 |
13 | a217110069c |
14 | 4bb505d60bb |
15 | 266a0976c81 |
hex | 1463554c6a5 |
1401054086821 has 2 divisors, whose sum is σ = 1401054086822. Its totient is φ = 1401054086820.
The previous prime is 1401054086819. The next prime is 1401054086857. The reversal of 1401054086821 is 1286804501041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1328749565796 + 72304521025 = 1152714^2 + 268895^2 .
It is a cyclic number.
It is not a de Polignac number, because 1401054086821 - 21 = 1401054086819 is a prime.
Together with 1401054086819, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1401054086891) 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 as a sum of consecutive naturals, namely, 700527043410 + 700527043411.
It is an arithmetic number, because the mean of its divisors is an integer number (700527043411).
Almost surely, 21401054086821 is an apocalyptic number.
It is an amenable number.
1401054086821 is a deficient number, since it is larger than the sum of its proper divisors (1).
1401054086821 is an equidigital number, since it uses as much as digits as its factorization.
1401054086821 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 61440, while the sum is 40.
Adding to 1401054086821 its reverse (1286804501041), we get a palindrome (2687858587862).
The spelling of 1401054086821 in words is "one trillion, four hundred one billion, fifty-four million, eighty-six thousand, eight hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •