Base | Representation |
---|---|
bin | 110001001001001100… |
… | …1001111011100110001 |
3 | 101002101221021222221022 |
4 | 1202102121033130301 |
5 | 3212114014234041 |
6 | 120252055505225 |
7 | 10424156203322 |
oct | 1422231173461 |
9 | 332357258838 |
10 | 105535305521 |
11 | 40836a24068 |
12 | 18553688215 |
13 | 9c4b535259 |
14 | 5172268449 |
15 | 2b2a18024b |
hex | 189264f731 |
105535305521 has 4 divisors (see below), whose sum is σ = 105545699952. Its totient is φ = 105524911092.
The previous prime is 105535305467. The next prime is 105535305539. The reversal of 105535305521 is 125503535501.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 125503535501 = 2753 ⋅45587917.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105535305521 is a prime.
It is a super-2 number, since 2×1055353055212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105535305721) 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, 5181971 + ... + 5202296.
It is an arithmetic number, because the mean of its divisors is an integer number (26386424988).
Almost surely, 2105535305521 is an apocalyptic number.
It is an amenable number.
105535305521 is a deficient number, since it is larger than the sum of its proper divisors (10394431).
105535305521 is a wasteful number, since it uses less digits than its factorization.
105535305521 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10394430.
The product of its (nonzero) digits is 56250, while the sum is 35.
The spelling of 105535305521 in words is "one hundred five billion, five hundred thirty-five million, three hundred five thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •