Base | Representation |
---|---|
bin | 1100001110000001011101… |
… | …1100101111001011110001 |
3 | 1202120101012210220211112021 |
4 | 3003200113130233023301 |
5 | 3230104441041024103 |
6 | 44323551031431441 |
7 | 2554436043132010 |
oct | 303402734571361 |
9 | 52511183824467 |
10 | 13435051111153 |
11 | 430a856112751 |
12 | 160b977525581 |
13 | 765bc5ca44c9 |
14 | 34638d3daa77 |
15 | 184723359bbd |
hex | c381772f2f1 |
13435051111153 has 8 divisors (see below), whose sum is σ = 15354469484672. Its totient is φ = 11515664077056.
The previous prime is 13435051111129. The next prime is 13435051111169. The reversal of 13435051111153 is 35111115053431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13435051111153 - 237 = 13297612157681 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13435051111103) 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 in 7 ways as a sum of consecutive naturals, for example, 6908925 + ... + 8637322.
It is an arithmetic number, because the mean of its divisors is an integer number (1919308685584).
Almost surely, 213435051111153 is an apocalyptic number.
It is an amenable number.
13435051111153 is a deficient number, since it is larger than the sum of its proper divisors (1919418373519).
13435051111153 is a wasteful number, since it uses less digits than its factorization.
13435051111153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15669711.
The product of its (nonzero) digits is 13500, while the sum is 34.
Adding to 13435051111153 its reverse (35111115053431), we get a palindrome (48546166164584).
The spelling of 13435051111153 in words is "thirteen trillion, four hundred thirty-five billion, fifty-one million, one hundred eleven thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •