13803
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 19008
- Proper Divisor Sum (Aliquot Sum)
- 5205
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8904
- Möbius Function
- -1
- Radical
- 13803
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 151
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- a(n) = 10000*log_10(n) rounded up.at n=23A004230
- a(n) = n-th prime number * n-th lucky number.at n=27A032601
- Numbers n such that 54 'Reverse and Add' steps are needed to reach a palindrome.at n=3A065321
- Gives an LCD representation of n.at n=22A071843
- Smallest k not a palindrome and not divisible by 10 such that k and R(k) (A004086) both are divisible by the n-th prime.at n=13A075605
- Smallest k not a palindrome and not divisible by 10 such that k and R(k) both are divisible by n, or 0 if n is divisible by 10.at n=42A075606
- A130041(n) is the a(n)-th composite number.at n=18A130042
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 0), (0, 0, -1), (0, 1, -1), (1, 0, 0)}.at n=11A148038
- Positive integers that are palindromes (of even length) in binary, each made by concatenating two identical binary palindromes.at n=19A161400
- Let b(n) be the n-th positive integer that is a palindrome in base 2. a(n) = the smallest multiple of b(n) that is > b(n) and that is also a palindrome in binary.at n=19A162843
- a(n) = 3*n*(5*n-1)/2.at n=42A167469
- Smallest number k such that omega(k)+ omega(k+1)+ omega(k+2)+ omega(k+3)= n.at n=11A175206
- a(n) = 12*n^2 - 2*n - 1.at n=34A185918
- Numbers k such that 81^k - 9^k - 1 is prime.at n=10A265487
- Numbers k such that 9*10^k + 67 is prime.at n=17A294679
- Numbers whose base-2 representation is a "nested" palindrome.at n=42A373941
- Numbers, when written in binary, that are a proper substring of the concatenation (with repetition) in increasing order of their prime factors, when written in binary.at n=7A378894