Base | Representation |
---|---|
bin | 10011101100010100101… |
… | …001011111111000100101 |
3 | 11210101000002112201221112 |
4 | 103230110221133320211 |
5 | 134132434321333221 |
6 | 2513402442154405 |
7 | 166525033510613 |
oct | 23542451377045 |
9 | 4711002481845 |
10 | 1353261121061 |
11 | 481a07694813 |
12 | 19a3304b2a05 |
13 | 9a7c5685ca5 |
14 | 496d90546b3 |
15 | 25304c3d15b |
hex | 13b14a5fe25 |
1353261121061 has 4 divisors (see below), whose sum is σ = 1366659746124. Its totient is φ = 1339862496000.
The previous prime is 1353261121039. The next prime is 1353261121099. The reversal of 1353261121061 is 1601211623531.
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 792269109025 + 560992012036 = 890095^2 + 748994^2 .
It is a cyclic number.
It is not a de Polignac number, because 1353261121061 - 26 = 1353261120997 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1353261121021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6699312380 + ... + 6699312581.
It is an arithmetic number, because the mean of its divisors is an integer number (341664936531).
Almost surely, 21353261121061 is an apocalyptic number.
It is an amenable number.
1353261121061 is a deficient number, since it is larger than the sum of its proper divisors (13398625063).
1353261121061 is a wasteful number, since it uses less digits than its factorization.
1353261121061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13398625062.
The product of its (nonzero) digits is 6480, while the sum is 32.
Adding to 1353261121061 its reverse (1601211623531), we get a palindrome (2954472744592).
The spelling of 1353261121061 in words is "one trillion, three hundred fifty-three billion, two hundred sixty-one million, one hundred twenty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •