5132
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 8988
- Proper Divisor Sum (Aliquot Sum)
- 3856
- 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
- 2564
- Möbius Function
- 0
- Radical
- 2566
- Omega Function (Ω)
- 3
- 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
- 54
- 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
- Number of words of length n in a certain language.at n=35A005819
- Number of partitions of n with at least 1 odd and 1 even part.at n=30A006477
- Numbers k such that the continued fraction for sqrt(k) has period 52.at n=28A020391
- a(n) is least k such that k and 8k are anagrams in base n (written in base 10).at n=6A023100
- Number of partitions of n into parts 4k and 4k+2 with at least one part of each type.at n=60A035622
- a(n)=(s(n)+5)/10, where s(n)=n-th base 10 palindrome that starts with 5.at n=35A043084
- Numbers m such that the factorizations of m..m+3 have the same number of primes (including multiplicities).at n=20A045940
- Becomes prime after exactly 7 iterations of f(x) = sum of prime factors of x.at n=4A047826
- Even numbers seen in decimal expansion of Pi (disregarding the decimal period) contiguous, smallest and distinct.at n=38A050818
- Numbers which retain their position in A073666 (position not disturbed by the rearrangement).at n=34A073667
- Numbers n such that 6*10^n + 8*R_n - 5 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=12A103045
- Start to read the sequence digit by digit and erase the first "1" you encounter, then the first "2", the first "3", etc., until the first "9"; go on from there and erase again the first "1", the first "2", etc., until "9" -- and so on, cyclically until the end of the (infinite) sequence. Concatenate what is left. The result is the concatenation of all integers of the sequence.at n=7A108709
- Total number of parts that appear exactly once in the partitions of n into odd parts.at n=47A116665
- Numbers n such that n, n+1, n+2 and n+3 are products of exactly 3 primes.at n=19A124057
- Successive differences of A000990.at n=23A147766
- 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, 0), (0, 0, 1), (0, 1, 0), (1, 1, -1), (1, 1, 1)}.at n=6A151191
- Row sums of number triangle A154221.at n=11A154222
- Even numbers in the decimal expansion of Pi, contiguous and shortest.at n=58A164524
- Numerator of A166100(A166101(n))/A166102(n).at n=18A166272
- Number of 5-step self-avoiding walks on an n X n square summed over all starting positions.at n=8A188150