Base | Representation |
---|---|
bin | 10101001111110000011… |
… | …111100111000011001101 |
3 | 12011120120220122022120022 |
4 | 111033300133213003031 |
5 | 142410114323402342 |
6 | 3034421122431525 |
7 | 210324605311232 |
oct | 25176037470315 |
9 | 5146526568508 |
10 | 1460028731597 |
11 | 513216179877 |
12 | 1b6b688025a5 |
13 | a78ac2b38b7 |
14 | 50946c1b789 |
15 | 27ea318a9d2 |
hex | 153f07e70cd |
1460028731597 has 2 divisors, whose sum is σ = 1460028731598. Its totient is φ = 1460028731596.
The previous prime is 1460028731537. The next prime is 1460028731617. The reversal of 1460028731597 is 7951378200641.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1439109737641 + 20918993956 = 1199629^2 + 144634^2 .
It is a cyclic number.
It is not a de Polignac number, because 1460028731597 - 212 = 1460028727501 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1460028731537) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 730014365798 + 730014365799.
It is an arithmetic number, because the mean of its divisors is an integer number (730014365799).
It is a 1-persistent number, because it is pandigital, but 2⋅1460028731597 = 2920057463194 is not.
Almost surely, 21460028731597 is an apocalyptic number.
It is an amenable number.
1460028731597 is a deficient number, since it is larger than the sum of its proper divisors (1).
1460028731597 is an equidigital number, since it uses as much as digits as its factorization.
1460028731597 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2540160, while the sum is 53.
The spelling of 1460028731597 in words is "one trillion, four hundred sixty billion, twenty-eight million, seven hundred thirty-one thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •