Base | Representation |
---|---|
bin | 10100010111110110100… |
… | …100001010000000101001 |
3 | 11221211122110221212021211 |
4 | 110113312210022000221 |
5 | 140414200231411041 |
6 | 2551052425033121 |
7 | 203101221350212 |
oct | 24276644120051 |
9 | 4854573855254 |
10 | 1400001044521 |
11 | 49a812101032 |
12 | 1a73b56257a1 |
13 | a2033bb1431 |
14 | 4ba907dc409 |
15 | 2663d2b9481 |
hex | 145f690a029 |
1400001044521 has 2 divisors, whose sum is σ = 1400001044522. Its totient is φ = 1400001044520.
The previous prime is 1400001044423. The next prime is 1400001044531. The reversal of 1400001044521 is 1254401000041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1393155302400 + 6845742121 = 1180320^2 + 82739^2 .
It is a cyclic number.
It is not a de Polignac number, because 1400001044521 - 233 = 1391411109929 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1400001044492 and 1400001044501.
It is not a weakly prime, because it can be changed into another prime (1400001044531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 700000522260 + 700000522261.
It is an arithmetic number, because the mean of its divisors is an integer number (700000522261).
Almost surely, 21400001044521 is an apocalyptic number.
It is an amenable number.
1400001044521 is a deficient number, since it is larger than the sum of its proper divisors (1).
1400001044521 is an equidigital number, since it uses as much as digits as its factorization.
1400001044521 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 640, while the sum is 22.
Adding to 1400001044521 its reverse (1254401000041), we get a palindrome (2654402044562).
The spelling of 1400001044521 in words is "one trillion, four hundred billion, one million, forty-four thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •