12762
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
- 4
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 27690
- Proper Divisor Sum (Aliquot Sum)
- 14928
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4248
- Möbius Function
- 0
- Radical
- 4254
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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
- 76
- 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
- Vampire numbers: (definition 1): n has a nontrivial factorization using n's digits.at n=33A020342
- Number of partitions of n with equal nonzero number of parts congruent to each of 2, 3 and 4 (mod 5).at n=57A035591
- Let (u1,u2) be successive untouchable numbers such that phi(u1) = phi(u2); sequence gives values of u2.at n=28A048190
- Numbers k such that k^18 == 1 (mod 19^3).at n=32A056089
- k = a*b where ab is cyclic permutation of the digits of k.at n=1A057116
- Integers expressible as the sum of (at least two) consecutive primes in at least 4 ways.at n=25A067374
- Triangle read by rows, related to A055129 (repunits in base k).at n=31A107893
- 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, 1), (0, 1, -1), (1, 0, 0), (1, 1, 1)}.at n=7A150818
- a(n) is the number of unordered pairs of disjoint set partitions of an n-element set.at n=6A152525
- Triangle read by rows: T(n,k) = number of pairs of partitions of n that have block distance k (n >= 2, 2 <= k <= n).at n=14A193297
- Numbers n such that n!8+1 is prime (for n!8 see A114800).at n=42A204661
- Records in A224796.at n=26A224719
- Number of (n+2) X (3+2) 0..2 arrays with every consecutive three elements in every row, column, diagonal and antidiagonal having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=6A252856
- Number of (n+2)X(7+2) 0..2 arrays with every consecutive three elements in every row, column, diagonal and antidiagonal having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=2A252860
- T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every consecutive three elements in every row, column, diagonal and antidiagonal having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=38A252861
- a(n) = (-1)^(n-1) + Sum_{d|n, d>1} binomial(a(n/d) + d - 1, d).at n=53A305610
- Numbers that are a sum of both four and six consecutive prime numbers.at n=24A380433
- Consecutive states of the linear congruential pseudo-random number generator (967*s + 3041) mod 14406 when started at s=1.at n=7A385078