12304
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 23870
- Proper Divisor Sum (Aliquot Sum)
- 11566
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6144
- Möbius Function
- 0
- Radical
- 1538
- Omega Function (Ω)
- 5
- 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
- 37
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = 10000*log_10(n) rounded down.at n=16A004228
- a(n) = 10000*log_10(n) rounded to the nearest integer.at n=16A004229
- Positive numbers k such that k and 3*k are anagrams in base 6 (written in base 6).at n=4A023065
- a(n) = T(n,0) + T(n,1) + ... + T(n,n), T given by A026907.at n=8A026915
- If d,e are consecutive digits of n in base 7, then |d-e|>=5.at n=35A032995
- Numbers ending with '4' that are the difference of two positive cubes.at n=29A038859
- (n+4)^3 - n^3.at n=29A038866
- Base-7 palindromes that start with 5.at n=22A043019
- a(0) = 19; for n>0, successively subtract 5, subtract 3 and double.at n=36A106706
- Number of degree n polynomials over GF(2) (with nonzero constant term) at Hamming distance 2 from some irreducible polynomial.at n=15A128902
- a(n) = 512n + 16.at n=23A157475
- Number of (n+1) X 2 binary arrays with rows and columns in nondecreasing order and with no 2 X 2 subblock sum differing from a horizontal or vertical neighbor subblock sum by more than one.at n=39A184063
- a(n) = (n^3 + 3*n^7)/4.at n=3A190636
- Numbers whose digits are a permutation of (0,...,m) for some m.at n=32A199168
- Number of (n+1) X 3 0..2 arrays with the number of clockwise edge increases in every 2 X 2 subblock equal to one, and every 2 X 2 determinant nonzero.at n=4A206004
- Number of (n+1)X6 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock equal to one, and every 2X2 determinant nonzero.at n=1A206007
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock equal to one, and every 2X2 determinant nonzero.at n=16A206010
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock equal to one, and every 2X2 determinant nonzero.at n=19A206010
- Number of (n+2) X (2+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 2 3 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 2 3 6 or 7.at n=11A252526
- a(n) = smallest k such that the digits of exactly n nonnegative numbers are a subsequence of the digits of k.at n=29A275782