4506
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 9024
- Proper Divisor Sum (Aliquot Sum)
- 4518
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 1500
- Möbius Function
- -1
- Radical
- 4506
- 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
- 46
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers that are the sum of 7 positive 7th powers.at n=16A003374
- a(n) = T(2n,n+3), T given by A026736.at n=5A026852
- a(n) = T(2*n+1, n+2), T given by A027011.at n=5A027017
- T(n,n+4), T given by A027960.at n=9A027964
- T(n, 2n-9), T given by A027960.at n=8A027971
- Graham-Sloane-type lower bound on the size of a ternary (n,3,9) constant-weight code.at n=3A030509
- Number of partitions of n into parts 4k+1 or 4k+2.at n=46A035365
- Sets of 4 consecutive numbers with equal number of divisors.at n=11A039665
- Numbers whose base-4 representation contains exactly three 1's and three 2's.at n=21A045103
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 2.at n=12A049968
- Numbers which are the sum of their proper divisors containing the digit 5.at n=6A059464
- Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,5.at n=12A064239
- Prime(n^2) +/- n are primes.at n=15A064495
- Numbers k such that phi(k) = phi(sigma(k)-k).at n=46A067880
- Number of 4-gonal compositions of n into positive parts.at n=38A069982
- Numbers k such that the number of distinct primes dividing k = number of anti-divisors of k.at n=33A073713
- Numbers k such that k*prime(k) -+ 1 are twin primes.at n=26A085637
- a(1) = 30; for n > 1, a(n+1) = a(n) + {product of nonzero digits of a(n)}.at n=42A095992
- Initial values for the iteration of the function f(x) = A063919(x) such that the iteration ends in a 5-cycle, i.e., in A097024.at n=33A097035
- Numbers n such that 5*10^n + 6*R_n - 3 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=14A103017