Base | Representation |
---|---|
bin | 10011000000100000011… |
… | …000111011000000101001 |
3 | 11121212120021002000210111 |
4 | 103000200120323000221 |
5 | 132400111121241212 |
6 | 2440022143414321 |
7 | 163241121143200 |
oct | 23004030730051 |
9 | 4555507060714 |
10 | 1306213462057 |
11 | 463a644a01a9 |
12 | 1911a02b43a1 |
13 | 96238481aca |
14 | 47314882237 |
15 | 23e9e675ea7 |
hex | 1302063b029 |
1306213462057 has 6 divisors (see below), whose sum is σ = 1519472802858. Its totient is φ = 1119611538864.
The previous prime is 1306213462049. The next prime is 1306213462139. The reversal of 1306213462057 is 7502643126031.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 869852810281 + 436360651776 = 932659^2 + 660576^2 .
It is not a de Polignac number, because 1306213462057 - 23 = 1306213462049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1306213462657) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 13328708748 + ... + 13328708845.
It is an arithmetic number, because the mean of its divisors is an integer number (253245467143).
Almost surely, 21306213462057 is an apocalyptic number.
It is an amenable number.
1306213462057 is a deficient number, since it is larger than the sum of its proper divisors (213259340801).
1306213462057 is an equidigital number, since it uses as much as digits as its factorization.
1306213462057 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26657417607 (or 26657417600 counting only the distinct ones).
The product of its (nonzero) digits is 181440, while the sum is 40.
Adding to 1306213462057 its reverse (7502643126031), we get a palindrome (8808856588088).
The spelling of 1306213462057 in words is "one trillion, three hundred six billion, two hundred thirteen million, four hundred sixty-two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •