7463
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 7920
- Proper Divisor Sum (Aliquot Sum)
- 457
- 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
- 7008
- Möbius Function
- 1
- Radical
- 7463
- 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
- 70
- 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
- no
- Odd
- yes
Appears in sequences
- 5th-order maximal independent sets in cycle graph.at n=50A007388
- a(n) = a(n-1) + a(n-2) + 1, with a(0) = 1 and a(1) = 10.at n=15A022324
- Discriminants of quintic fields with 2 complex conjugates (negated).at n=6A023684
- Derivative of log of A007360.at n=40A023892
- 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 85.at n=20A031583
- Numbers whose set of base-9 digits is {1,2}.at n=35A032930
- Numbers whose base-3 representation has exactly 9 runs.at n=17A043589
- Numbers n such that number of runs in the base 3 representation of n is congruent to 1 mod 8.at n=33A043799
- Numbers n such that number of runs in the base 3 representation of n is congruent to 0 mod 9.at n=17A043806
- Numbers k such that number of runs in the base 3 representation of k is congruent to 9 mod 10.at n=17A043824
- Numbers n such that A051885(p_n) is prime, where p_n=A000040(n) is the n-th prime.at n=29A055019
- a(n) = (9*n^2 + 13*n + 6)/2.at n=40A064226
- Numbers n such that phi(2n-1) = sigma(n).at n=28A067230
- Numbers n such that sigma(n)=phi(n*bigomega(n)-1).at n=22A067877
- Numbers k such that sigma(k) = phi(k*omega(k)-1).at n=33A067878
- Arithmetic derivative of n*prime(n).at n=41A068981
- Binomial transform of poly-Bernoulli numbers A027649.at n=6A085350
- Numbers n such that A003313(n) = A003313(2n).at n=25A086878
- Recursive sequence; one more than maximum of products of pairs of previous terms with indices summing to current index.at n=21A091980
- a(1) = 10; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=38A111524