10537
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10836
- Proper Divisor Sum (Aliquot Sum)
- 299
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10240
- Möbius Function
- 1
- Radical
- 10537
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 78
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Smallest number m such that the trajectory of m under iteration of Euler's totient function phi(n) [A000010] contains exactly n distinct numbers, including m and the fixed point.at n=14A007755
- Numbers k such that the continued fraction for sqrt(k) has period 55.at n=12A020394
- Apart from initial terms, same as A007755, which is a better version.at n=13A040176
- Denominators of continued fraction convergents to sqrt(970).at n=8A042877
- Semiprimes p1*p2 such that p2 > p1 and p2 mod p1 = 11.at n=35A064909
- Sum of next n odd interprimes.at n=10A075674
- Number of brilliant numbers < 10^n.at n=5A086846
- Partial sums of A087434.at n=2A087435
- Smallest nonprime number which if used as initial term for iteration of the A000010[x] function, results in list-to-fixed-point of length=n, or 0 if no such number exists.at n=14A098196
- Round(1000*x), where x is the solution to x = 5^(n-x).at n=12A104744
- Numbers k such that k and 8*k, taken together, are pandigital.at n=2A114126
- Number of binary strings of length n with no substrings equal to 0001 0010 or 1101.at n=19A164452
- An Ulam-type sequence: a(n) = n if n<=10; for n>10, a(n) = least number > a(n-1) which is a unique sum of 10 distinct earlier terms.at n=47A183533
- Smallest k such that phi(phi(k)) = 2^n, where phi is the Euler totient function.at n=11A184968
- Product of exactly two distinct primes congruent to 1 mod 8 (A007519).at n=39A185377
- Records in A087669.at n=29A192230
- Semiprimes which have one or more occurrences of exactly five different digits.at n=30A235693
- Five-digit odd semiprimes with all digits distinct.at n=23A247948
- Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 145", based on the 5-celled von Neumann neighborhood.at n=15A279150
- Solution of the complementary equation a(n) = 2*a(n-1) - a(n-2) + b(n-1), where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=36A294866