Base | Representation |
---|---|
bin | 10011001001101001001… |
… | …010001001011100001001 |
3 | 11122210212222211012222122 |
4 | 103021221022021130021 |
5 | 133030204202312421 |
6 | 2444323451101025 |
7 | 164036210433536 |
oct | 23115112113411 |
9 | 4583788735878 |
10 | 1316024260361 |
11 | 468139428178 |
12 | 193079a41775 |
13 | 9713cbc5cc5 |
14 | 479a5833d8d |
15 | 24375b0e2ab |
hex | 13269289709 |
1316024260361 has 16 divisors (see below), whose sum is σ = 1399602665040. Its totient is φ = 1235061354240.
The previous prime is 1316024260357. The next prime is 1316024260381. The reversal of 1316024260361 is 1630624206131.
It can be written as a sum of positive squares in 8 ways, for example, as 130451714761 + 1185572545600 = 361181^2 + 1088840^2 .
It is not a de Polignac number, because 1316024260361 - 22 = 1316024260357 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1316024260381) 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 in 15 ways as a sum of consecutive naturals, for example, 454691 + ... + 1684871.
It is an arithmetic number, because the mean of its divisors is an integer number (87475166565).
Almost surely, 21316024260361 is an apocalyptic number.
It is an amenable number.
1316024260361 is a deficient number, since it is larger than the sum of its proper divisors (83578404679).
1316024260361 is a wasteful number, since it uses less digits than its factorization.
1316024260361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1231244.
The product of its (nonzero) digits is 31104, while the sum is 35.
Adding to 1316024260361 its reverse (1630624206131), we get a palindrome (2946648466492).
The spelling of 1316024260361 in words is "one trillion, three hundred sixteen billion, twenty-four million, two hundred sixty thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •