15622
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 23976
- Proper Divisor Sum (Aliquot Sum)
- 8354
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7632
- Möbius Function
- -1
- Radical
- 15622
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 102
- 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
- "Orderly" Friedman numbers (or "good" or "nice" Friedman numbers): Friedman numbers (A036057) where the construction digits are used in the proper order.at n=26A080035
- a(1)= 10000, a(2)= 10000; for n>2, a(n)= ( a(n-2) + a(n-1) ) (mod 20000).at n=29A096973
- 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=5A156954
- 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=7A157198
- 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=23A163497
- Number of partitions of n with distinct occurrences of parts.at n=51A166239
- Monotonic ordering of nonnegative differences 5^i-3^j, for 40>=i>=0, j>=0.at n=32A192150
- Friedman numbers n such that n+1 is also a Friedman number.at n=36A195420
- Total sum of parts greater than 1 in all the partitions of n except one copy of the smallest part greater than 1 of every partition.at n=21A196025
- Triangle of coefficients of polynomials u(n,x) jointly generated with A207626; see the Formula section.at n=50A207625
- Total number of congruence subgroups of PSL(2,Z) of genus n.at n=10A258691
- Numbers that can be represented using their digits in the order of appearance, the operations +, -, *, /, ^, and any parentheses.at n=26A386936