Base | Representation |
---|---|
bin | 10100101010110101000… |
… | …010101101100010111101 |
3 | 12000210020111011001102112 |
4 | 110222311002231202331 |
5 | 141232412402011441 |
6 | 3004302331503405 |
7 | 204422153564315 |
oct | 24526502554275 |
9 | 5023214131375 |
10 | 1420376594621 |
11 | 4a8418616436 |
12 | 1ab3412b7b65 |
13 | a3c3031995a |
14 | 4ca64922445 |
15 | 26e31eb94eb |
hex | 14ab50ad8bd |
1420376594621 has 2 divisors, whose sum is σ = 1420376594622. Its totient is φ = 1420376594620.
The previous prime is 1420376594557. The next prime is 1420376594633. The reversal of 1420376594621 is 1264956730241.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 717512337721 + 702864256900 = 847061^2 + 838370^2 .
It is a cyclic number.
It is not a de Polignac number, because 1420376594621 - 26 = 1420376594557 is a prime.
It is a super-2 number, since 2×14203765946212 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1420376594621.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1420376590621) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 710188297310 + 710188297311.
It is an arithmetic number, because the mean of its divisors is an integer number (710188297311).
Almost surely, 21420376594621 is an apocalyptic number.
It is an amenable number.
1420376594621 is a deficient number, since it is larger than the sum of its proper divisors (1).
1420376594621 is an equidigital number, since it uses as much as digits as its factorization.
1420376594621 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2177280, while the sum is 50.
The spelling of 1420376594621 in words is "one trillion, four hundred twenty billion, three hundred seventy-six million, five hundred ninety-four thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •