Base | Representation |
---|---|
bin | 10011110101111101101… |
… | …100101101101100101001 |
3 | 11211100201120101101210201 |
4 | 103311331230231230221 |
5 | 134320140024200340 |
6 | 2522234013512201 |
7 | 200342420363116 |
oct | 23657554555451 |
9 | 4740646341721 |
10 | 1363613506345 |
11 | 48633a303032 |
12 | 1a033b4a2661 |
13 | 9b78538325c |
14 | 49ddbd0590d |
15 | 2570da0679a |
hex | 13d7db2db29 |
1363613506345 has 4 divisors (see below), whose sum is σ = 1636336207620. Its totient is φ = 1090890805072.
The previous prime is 1363613506313. The next prime is 1363613506357. The reversal of 1363613506345 is 5436053163631.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 548045570601 + 815567935744 = 740301^2 + 903088^2 .
It is a cyclic number.
It is not a de Polignac number, because 1363613506345 - 25 = 1363613506313 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1363613506295 and 1363613506304.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 136361350630 + ... + 136361350639.
It is an arithmetic number, because the mean of its divisors is an integer number (409084051905).
Almost surely, 21363613506345 is an apocalyptic number.
It is an amenable number.
1363613506345 is a deficient number, since it is larger than the sum of its proper divisors (272722701275).
1363613506345 is an equidigital number, since it uses as much as digits as its factorization.
1363613506345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 272722701274.
The product of its (nonzero) digits is 1749600, while the sum is 46.
Adding to 1363613506345 its reverse (5436053163631), we get a palindrome (6799666669976).
The spelling of 1363613506345 in words is "one trillion, three hundred sixty-three billion, six hundred thirteen million, five hundred six thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •