15363
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22800
- Proper Divisor Sum (Aliquot Sum)
- 7437
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10224
- Möbius Function
- 0
- Radical
- 1707
- Omega Function (Ω)
- 4
- 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
- 177
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Numbers whose base-4 representation contains exactly four 0's and three 3's.at n=10A045084
- Sums of two or more distinct 4th powers of primes.at n=17A130833
- Number of days after Jan 01 1000 such that the date written in the format DDMMYYYY is palindromic.at n=15A210885
- Number of (n+1) X (6+1) 0..1 arrays with every 2 X 2 subblock diagonal minimum minus antidiagonal minimum nondecreasing horizontally and diagonal maximum minus antidiagonal maximum nondecreasing vertically.at n=6A253229
- Number of (n+1) X (7+1) 0..1 arrays with every 2 X 2 subblock diagonal minimum minus antidiagonal minimum nondecreasing horizontally and diagonal maximum minus antidiagonal maximum nondecreasing vertically.at n=5A253230
- Number of n X 2 0..1 arrays with no 1 equal to more than four of its king-move neighbors.at n=6A282310
- Number of nX7 0..1 arrays with no 1 equal to more than four of its king-move neighbors.at n=1A282315
- T(n,k)=Number of nXk 0..1 arrays with no 1 equal to more than four of its king-move neighbors.at n=29A282316
- T(n,k)=Number of nXk 0..1 arrays with no 1 equal to more than four of its king-move neighbors.at n=34A282316
- Integers that concatenate 3 counts: the number of terms in the sequence so far, the number of primes in the sequence so far, the number of digits in the sequence so far, with a(1)= 113. The sequence is always extended with the smallest available integer not leading to a contradiction or a dead end.at n=14A309617
- Number of multisets of exactly five partitions of positive integers into distinct parts with total sum of parts equal to n.at n=19A320790
- Sum of the third largest parts of the partitions of n into 8 squarefree parts.at n=52A326450
- Number of partitions of n into an odd number of parts that are not multiples of 3.at n=52A339405
- a(n)^2 is the end of the first occurrence of n consecutive perfect powers, all of which are squares with exponents equal to 2 (A111245).at n=37A340664
- Number A(n,k) of walks on square lattice from (n,k) to (0,0) using steps that decrease the Euclidean distance to the origin and increase the Euclidean distance to (n,k) and that change each coordinate by at most 1; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=47A346540
- Number A(n,k) of walks on square lattice from (n,k) to (0,0) using steps that decrease the Euclidean distance to the origin and increase the Euclidean distance to (n,k) and that change each coordinate by at most 1; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=52A346540