15926
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 23892
- Proper Divisor Sum (Aliquot Sum)
- 7966
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7962
- Möbius Function
- 1
- Radical
- 15926
- 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
- 252
- 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
- yes
- Odd
- no
Appears in sequences
- Inverse Euler transform of A000016.at n=20A057772
- Numbers with distinct digits appearing in partition of decimal expansion of Pi.at n=1A104819
- Integers n such that 9*10^n + 11 is a prime number.at n=20A111023
- Numbers n such that the sum of the squares of the digits of n^n is a square.at n=19A171976
- Number of n element 0..2 arrays with each element the minimum of 7 adjacent elements of a random 0..2 array of n+6 elements.at n=15A217882
- Number of nonnegative integer arrays of length n summing to n without adjacent equal values.at n=12A221235
- Records in A224796.at n=30A224719
- Semiprimes in the order in which they appear in the decimal expansion of Pi.at n=13A226943
- G.f.: 1/((1-t^9)^2*(1-t)*(1-t^3)*(1-t^5)*(1-t^7)*(1-t^11)*(1-t^13)*(1-t^15)*(1-t^17)).at n=65A266749
- Expansion of Product_{k>=1} (1 + x^k)^k / (1 + x^(4*k))^(4*k).at n=22A285292
- Number of permutations of [n] avoiding {1324, 2341, 3421}.at n=10A294800
- a(n) is the number of Q-bases which can be built from the set {log(1),...,log(n)}.at n=32A307984
- Scan first k digits of Pi after decimal point, for k = 1,2,3,..., record all distinct numbers in the order in which they appear.at n=22A322776
- Scan first k digits of Pi starting with 3, for k = 1,2,3,..., record all distinct numbers in the order in which they appear.at n=30A322777
- Numbers k such that 375*2^k+1 is prime.at n=47A323028
- Numbers m such that there exists at least one integer k < m where m^2 + 2 and k^2 + 2 have the same prime factors.at n=30A348889
- G.f. A(x) satisfies A(x) = 1 + x*A(x)*(1 + x^4*A(x)^5).at n=14A365760
- Expansion of g.f. A(x) satisfying A(x)^2 = A( x^2 + 2*x*A(x)^2 + 2*A(x)^3 ).at n=6A374567