9269
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 10752
- Proper Divisor Sum (Aliquot Sum)
- 1483
- 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
- 7920
- Möbius Function
- -1
- Radical
- 9269
- Omega Function (Ω)
- 3
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 34
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Eight iterations of Reverse and Add are needed to reach a palindrome.at n=39A015988
- a(n) = 1*t(n) + 2*t(n-1) + ...+ k*t(n+1-k), where k=floor((n+1)/2) and t is A001950 (upper Wythoff sequence).at n=33A023867
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = A001950 (upper Wythoff sequence).at n=32A024864
- Denominators of continued fraction convergents to sqrt(307).at n=7A041579
- Numbers which need eight 'Reverse and Add' steps to reach a palindrome.at n=34A065213
- a(n) = 3*a(n-1) + 5*a(n-2), with a(0)=1, a(1)=1.at n=7A072264
- Numbers which are the sum of two positive cubes and divisible by 23.at n=9A101806
- Numbers which are the sum of two positive cubes and divisible by 31.at n=16A102658
- Odd terms of A059756.at n=6A111042
- Least number k such that k, k+n, k+2*n and k+3*n have the same number of divisors.at n=34A113468
- Number of planar partitions of n with all part sizes distinct.at n=32A117433
- 3-almost primes that are the sum of 2 positive cubes. Sums of 2 positive cubes, with the sums having exactly 3 prime divisors counted with multiplicity.at n=32A122732
- Partial sums of A032598.at n=12A129330
- Odd squarefree numbers n such that the cyclotomic polynomial Phi(n,x) has height 5.at n=24A152943
- Products of three distinct happy primes A035497.at n=10A154717
- Numbers n with following property: let c = nearest cube to n that is different from n and let p = nearest prime to n that is different from n. Then |n-c| = |n-p|.at n=20A163497
- Number of 2n-digit primes that are concatenation of n two-digit distinct primes p_1...p_n: 10<p_1<p_2<...<p_n>98.at n=12A168519
- Numbers n such that phi(n)=2*phi(n-1).at n=15A171271
- Number of nondecreasing arrangements of n+2 numbers in 0..8 with the last equal to 8 and each after the second equal to the sum of one or two of the preceding three.at n=27A190040
- Increasing sequence generated by these rules: a(1)=1, and if x is in a then 3x+2 and 4x-3 are in a.at n=50A191139