Base | Representation |
---|---|
bin | 10100010111111101110… |
… | …111111000000111011101 |
3 | 11221211222000200002201122 |
4 | 110113331313320013131 |
5 | 140414423123421441 |
6 | 2551112525020325 |
7 | 203104240462106 |
oct | 24277567700735 |
9 | 4854860602648 |
10 | 1400123654621 |
11 | 49a87533589a |
12 | 1a742a6b46a5 |
13 | a20534103a3 |
14 | 4baa2bd73ad |
15 | 26648e3834b |
hex | 145fddf81dd |
1400123654621 has 2 divisors, whose sum is σ = 1400123654622. Its totient is φ = 1400123654620.
The previous prime is 1400123654603. The next prime is 1400123654623. The reversal of 1400123654621 is 1264563210041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1360687255225 + 39436399396 = 1166485^2 + 198586^2 .
It is a cyclic number.
It is not a de Polignac number, because 1400123654621 - 26 = 1400123654557 is a prime.
It is a Sophie Germain prime.
Together with 1400123654623, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1400123654623) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 700061827310 + 700061827311.
It is an arithmetic number, because the mean of its divisors is an integer number (700061827311).
Almost surely, 21400123654621 is an apocalyptic number.
It is an amenable number.
1400123654621 is a deficient number, since it is larger than the sum of its proper divisors (1).
1400123654621 is an equidigital number, since it uses as much as digits as its factorization.
1400123654621 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 34560, while the sum is 35.
Adding to 1400123654621 its reverse (1264563210041), we get a palindrome (2664686864662).
The spelling of 1400123654621 in words is "one trillion, four hundred billion, one hundred twenty-three million, six hundred fifty-four thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •