15656
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 31200
- Proper Divisor Sum (Aliquot Sum)
- 15544
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7344
- Möbius Function
- 0
- Radical
- 3914
- Omega Function (Ω)
- 5
- 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
- 53
- 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
- Sums of 4 distinct powers of 5.at n=15A038476
- Obtainable by applying +, * and exponentiation to its own digits.at n=25A046469
- "Orderly" Friedman numbers (or "good" or "nice" Friedman numbers): Friedman numbers (A036057) where the construction digits are used in the proper order.at n=35A080035
- Integers N such that by inserting + or - or * or / or ^ between each of their digits, without any grouping parentheses, you can get N (the ambiguous a^b^c is avoided).at n=10A156954
- Integers n such that by inserting between their digits + or - or * or / or ^ or nothing (i.e., concatenate two digits) you recover n back in a nontrivial way.at n=12A157198
- a(n) = 5^n + 5*n + 1.at n=6A176916
- Number of (w,x,y,z) with all terms in {0,...,n} and (least gapsize)=2.at n=16A212895
- a(n) = pg(n, 3) + pg(n, 4) + ... + pg(n, n) where pg(n, m) is the m-th n-th-order polygonal number.at n=18A245679
- a(n) = n*(105*n^3 - 210*n^2 + 147*n - 34).at n=4A272357
- Sum of the even singletons in all partitions of n (n>=0). A singleton in a partition is a part that occurs exactly once.at n=26A276425
- Numbers k such that k and k + 1 has the same value of A319445, the equivalent of the Euler totient function in the ring of Eisenstein integers.at n=9A332530
- Greedy Cantor's Dust Partition.at n=44A348636
- Number of edges formed in a square by straight line segments when connecting the four corner vertices to the points dividing the sides into n equal parts.at n=21A355948
- Numbers that can be represented using their digits in the order of appearance, the operations +, -, *, /, ^, and any parentheses.at n=32A386936