9427
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10296
- Proper Divisor Sum (Aliquot Sum)
- 869
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8560
- Möbius Function
- 1
- Radical
- 9427
- 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
- 153
- Smith Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Eleven iterations of Reverse and Add are needed to reach a palindrome.at n=39A015992
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 97.at n=2A031595
- Numbers whose set of base-8 digits is {2,3}.at n=35A032808
- Least inverse of A048182.at n=28A048183
- Numbers k such that k^16 == 1 (mod 17^3).at n=29A056088
- Numbers which need eleven 'Reverse and Add' steps to reach a palindrome.at n=37A065216
- The number of possible values of the squarefree kernel (A007947) shared by at least two solutions x to A056239(x) = n.at n=46A088318
- Hypercomma numbers: n occurs in the sequence S[k+1]=S[k]+10*last_digit(S[k-1])+first_digit(S[k]) for each "legal" splitting n=concat(S[0],S[1]).at n=31A166508
- 3-comma numbers: n occurs in the sequence S[k+1]=S[k]+10*last_digit(S[k-1])+first_digit(S[k]) for three different splittings n=concat(S[0],S[1]).at n=3A166513
- Numbers k that are the products of two distinct primes such that 2*k-1, 4*k-3, 8*k-7 and 16*k-15 are also products of two distinct primes.at n=39A177213
- Numbers k that are the products of two distinct primes such that 2*k-1, 4*k-3, 8*k-7, 16*k-15 and 32*k-31 are also products of two distinct primes.at n=13A177214
- Number of n X 3 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 1,3,2,0,4 for x=0,1,2,3,4.at n=7A196631
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 1,3,2,0,4 for x=0,1,2,3,4.at n=47A196636
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 1,3,2,0,4 for x=0,1,2,3,4.at n=52A196636
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 1,4,2,0,3 for x=0,1,2,3,4.at n=47A196641
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 1,4,2,0,3 for x=0,1,2,3,4.at n=52A196641
- Sum of all region numbers of all parts of all partitions of n.at n=10A210972
- Numbers n such that the decimal expansions of both n and n^2 have 2 as smallest digit and 9 as largest digit.at n=43A257485
- Number of partitions of n into two sorts of parts having exactly 2 parts of the second sort.at n=16A258472
- a(n) = 4*n^2 - 4*n + 19, n >= 1.at n=48A259054