12303
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 17784
- Proper Divisor Sum (Aliquot Sum)
- 5481
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8196
- Möbius Function
- 0
- Radical
- 4101
- Omega Function (Ω)
- 3
- 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
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 112
- 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
- Numerators of continued fraction convergents to sqrt(854).at n=4A042648
- Numbers whose base-4 representation contains exactly four 0's and three 3's.at n=0A045084
- a(1) = 3; a(n) = smallest number such that the forward as well as the reverse n-th partial concatenation is a prime for n>1. (Reverse concatenation is taken term-wise and not digit-wise).at n=26A083993
- Riordan array (1/((1-4*x)*c(x)),x*c(x)/sqrt(1-4*x)), c(x) the g.f. of A000108.at n=50A113955
- a(n) is the smallest number such that twice the number of divisors of (a(n)-n)/3 gives the n-th term in the first differences of the sequence produced by the Flavius Josephus sieve, A000960.at n=14A130826
- Number of distinct values taken by 5^5^...^5 (with n 5's and parentheses inserted in all possible ways).at n=12A145545
- Numbers n with property that 4 n^2 are squares arising in A158470.at n=29A158517
- Numbers k such that there are 14 primes between 100*k and 100*k + 99.at n=34A186406
- Number of (2+2) X (n+2) 0..3 arrays with every consecutive three elements in every row and diagonal having exactly two distinct values, and in every column and antidiagonal not having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=27A252721
- Number of n X 3 nonnegative integer arrays with upper left 0 and every value within 2 of its king move distance from the upper left and every value increasing by 0 or 1 with every step right, diagonally se or down.at n=19A252831
- Pseudoprimes to base 4, written in base 4.at n=4A262101
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 371", based on the 5-celled von Neumann neighborhood.at n=25A271456
- Number of 9-element subsets of [n] whose sum is a triangular number.at n=11A320855
- Starts of runs of 4 consecutive Gray-code Niven numbers (A344341).at n=18A344344
- Number of ways to choose a distinct subsequence of an integer composition of n.at n=10A355387
- a(n) = Sum_{d|n} (2*d)^(n/d - 1).at n=13A359134
- Number of integer partitions of n having no permutation with all equal run-sums.at n=34A383096