Base | Representation |
---|---|
bin | 1010011001100110111110… |
… | …0011100110110101101101 |
3 | 1111111011221000011122120111 |
4 | 2212121233203212311231 |
5 | 2444323013041001203 |
6 | 40153111205020021 |
7 | 2260104543623113 |
oct | 246315743466555 |
9 | 44434830148514 |
10 | 11435074547053 |
11 | 3709651519683 |
12 | 134823b3b4611 |
13 | 64c427557441 |
14 | 2b7663acbab3 |
15 | 14c6bc45b26d |
hex | a666f8e6d6d |
11435074547053 has 2 divisors, whose sum is σ = 11435074547054. Its totient is φ = 11435074547052.
The previous prime is 11435074547047. The next prime is 11435074547101. The reversal of 11435074547053 is 35074547053411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9300956764009 + 2134117783044 = 3049747^2 + 1460862^2 .
It is a cyclic number.
It is not a de Polignac number, because 11435074547053 - 25 = 11435074547021 is a prime.
It is a super-2 number, since 2×114350745470532 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11435074546988 and 11435074547006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11435074527053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5717537273526 + 5717537273527.
It is an arithmetic number, because the mean of its divisors is an integer number (5717537273527).
Almost surely, 211435074547053 is an apocalyptic number.
It is an amenable number.
11435074547053 is a deficient number, since it is larger than the sum of its proper divisors (1).
11435074547053 is an equidigital number, since it uses as much as digits as its factorization.
11435074547053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3528000, while the sum is 49.
The spelling of 11435074547053 in words is "eleven trillion, four hundred thirty-five billion, seventy-four million, five hundred forty-seven thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •