Base | Representation |
---|---|
bin | 11110110111001001101… |
… | …00110110001001110011 |
3 | 10202101002011120211011001 |
4 | 33123210310312021303 |
5 | 114333200124411423 |
6 | 2131050321502431 |
7 | 136416503615626 |
oct | 17334464661163 |
9 | 3671064524131 |
10 | 1060401013363 |
11 | 37979380025a |
12 | 15161a1a1a17 |
13 | 78cc2b30633 |
14 | 39476285dbd |
15 | 1c8b42cccad |
hex | f6e4d36273 |
1060401013363 has 2 divisors, whose sum is σ = 1060401013364. Its totient is φ = 1060401013362.
The previous prime is 1060401013361. The next prime is 1060401013403. The reversal of 1060401013363 is 3633101040601.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1060401013363 - 21 = 1060401013361 is a prime.
It is a super-2 number, since 2×10604010133632 (a number of 25 digits) contains 22 as substring.
Together with 1060401013361, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1060401013361) 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, 530200506681 + 530200506682.
It is an arithmetic number, because the mean of its divisors is an integer number (530200506682).
Almost surely, 21060401013363 is an apocalyptic number.
1060401013363 is a deficient number, since it is larger than the sum of its proper divisors (1).
1060401013363 is an equidigital number, since it uses as much as digits as its factorization.
1060401013363 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 28.
Adding to 1060401013363 its reverse (3633101040601), we get a palindrome (4693502053964).
The spelling of 1060401013363 in words is "one trillion, sixty billion, four hundred one million, thirteen thousand, three hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •