13543
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
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14040
- Proper Divisor Sum (Aliquot Sum)
- 497
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13048
- Möbius Function
- 1
- Radical
- 13543
- 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
- 94
- 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
- Number of protruded partitions of n with largest part at most 4.at n=15A005405
- Tetranacci numbers arising in connection with current algebras sp(2)_n.at n=13A014610
- a(n) = self-convolution of row n of array T given by A027960.at n=7A027978
- Sort then Add, a(1)=7.at n=12A033895
- Number of partitions of n into at most 1 copy of 1, 2 copies of 2, 3 copies of 3, ... .at n=45A052335
- Numbers k such that sigma(k) divides sigma(phi(k)).at n=40A066831
- Numbers n such that sigma(phi(n))/sigma(n) = 2.at n=27A067382
- Engel expansion of zeta(8)=sum(i>0,1/i^8).at n=5A067916
- 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), (-1, 1, 0), (0, 0, 1), (1, 0, -1)}.at n=11A148074
- Number of arrays of -1..1 integers x(1..n) with every x(i) in a subsequence of length 1, 2 or 3 with sum zero.at n=10A193695
- Numbers k such that 81^k - 9^k - 1 is prime.at n=9A265487
- Smallest b such that the k consecutive primes starting with prime(n) are all base-b Wieferich primes, i.e., satisfy b^(p-1) == 1 (mod p^2). Square array A(n, k), read by antidiagonals downwards.at n=23A286816
- Smallest b such that the k consecutive primes starting with prime(n) are all base-b Wieferich primes, i.e., satisfy b^(p-1) == 1 (mod p^2). Square array A(n, k), read by antidiagonals downwards.at n=24A286816
- Numbers k such that sigma(k) - k - 1 is a perfect number.at n=6A293992
- Number of n X n 0..1 arrays with each 1 adjacent to 2, 4 or 5 king-move neighboring 1's.at n=4A296967
- Number of nX5 0..1 arrays with each 1 adjacent to 2, 4 or 5 king-move neighboring 1s.at n=4A296971
- T(n,k)=Number of nXk 0..1 arrays with each 1 adjacent to 2, 4 or 5 king-move neighboring 1s.at n=40A296974
- A(n, k) is the k-th number b > 1 such that b^(prime(n+i)-1) == 1 (mod prime(n+i)^2) for each i = 0..3, with k running over the positive integers; square array, read by antidiagonals, downwards.at n=9A319061
- A(n, k) is the k-th number b > 1 such that b^(prime(n+i)-1) == 1 (mod prime(n+i)^2) for each i = 0..3, with k running over the positive integers; square array, read by antidiagonals, downwards.at n=17A319061
- A(n, k) is the k-th number b > 1 such that b^(prime(n+i)-1) == 1 (mod prime(n+i)^2) for each i = 0..4, with k running over the positive integers; square array, read by antidiagonals, downwards.at n=5A319062