Base | Representation |
---|---|
bin | 1100010011110001111001… |
… | …1001110011001111110101 |
3 | 1202220211111101110001102221 |
4 | 3010330132121303033311 |
5 | 3233220013204422220 |
6 | 44441224533402341 |
7 | 2564536643101243 |
oct | 304743631631765 |
9 | 52824441401387 |
10 | 13533952029685 |
11 | 434879810065a |
12 | 1626b791993b1 |
13 | 772327b95389 |
14 | 34b0924bb793 |
15 | 1870b0d409aa |
hex | c4f1e6733f5 |
13533952029685 has 4 divisors (see below), whose sum is σ = 16240742435628. Its totient is φ = 10827161623744.
The previous prime is 13533952029601. The next prime is 13533952029701. The reversal of 13533952029685 is 58692025933531.
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 2364072302916 + 11169879726769 = 1537554^2 + 3342137^2 .
It is a cyclic number.
It is not a de Polignac number, because 13533952029685 - 223 = 13533943641077 is a prime.
It is a super-2 number, since 2×135339520296852 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
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, 1353395202964 + ... + 1353395202973.
It is an arithmetic number, because the mean of its divisors is an integer number (4060185608907).
Almost surely, 213533952029685 is an apocalyptic number.
It is an amenable number.
13533952029685 is a deficient number, since it is larger than the sum of its proper divisors (2706790405943).
13533952029685 is an equidigital number, since it uses as much as digits as its factorization.
13533952029685 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2706790405942.
The product of its (nonzero) digits is 52488000, while the sum is 61.
The spelling of 13533952029685 in words is "thirteen trillion, five hundred thirty-three billion, nine hundred fifty-two million, twenty-nine thousand, six hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •