Base | Representation |
---|---|
bin | 1001100110110000101111… |
… | …0110100101110101110101 |
3 | 1101101200010201122121000100 |
4 | 2121230023312211311311 |
5 | 2341020000000103023 |
6 | 34243521421104313 |
7 | 2140021253006436 |
oct | 231541366456565 |
9 | 41350121577010 |
10 | 10561523441013 |
11 | 340213170a336 |
12 | 1226a889b8099 |
13 | 5b7c4154215c |
14 | 28727528b48d |
15 | 134ae1e03c43 |
hex | 99b0bda5d75 |
10561523441013 has 12 divisors (see below), whose sum is σ = 15260488603360. Its totient is φ = 7038728822376.
The previous prime is 10561523441011. The next prime is 10561523441047. The reversal of 10561523441013 is 31014432516501.
10561523441013 is a `hidden beast` number, since 1 + 0 + 5 + 6 + 1 + 5 + 234 + 410 + 1 + 3 = 666.
It is not a de Polignac number, because 10561523441013 - 21 = 10561523441011 is a prime.
It is a super-2 number, since 2×105615234410132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10561523441011) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 190537831 + ... + 190593252.
Almost surely, 210561523441013 is an apocalyptic number.
It is an amenable number.
10561523441013 is a deficient number, since it is larger than the sum of its proper divisors (4698965162347).
10561523441013 is a wasteful number, since it uses less digits than its factorization.
10561523441013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 381134168 (or 381134165 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 36.
Adding to 10561523441013 its reverse (31014432516501), we get a palindrome (41575955957514).
The spelling of 10561523441013 in words is "ten trillion, five hundred sixty-one billion, five hundred twenty-three million, four hundred forty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •