15351
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- yes
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 25344
- Proper Divisor Sum (Aliquot Sum)
- 9993
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8064
- Möbius Function
- 1
- Radical
- 15351
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 177
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers that are palindromic in bases 2 and 10.at n=13A007632
- a(n) = (2*n+1)*(12*n+1).at n=25A033576
- a(n) = T(n,n), array T given by A047858.at n=10A036542
- Palindromic and divisible by 7.at n=40A045642
- Palindromes with exactly 4 distinct prime factors.at n=9A046394
- Numbers that are palindromic in base 2 as well as in base 10 (initial zeros may be prepended).at n=42A069024
- Numbers n such that n and 2n+1 are both palindromes.at n=31A069881
- Numbers n such that RevBinary(RevDecimal(n))=RevDecimal(RevBinary(n)), where RevDecimal(n) is the decimal reversal of n (A004086) and RevBinary(n) is the binary reversal of n (A030101).at n=47A081433
- Numbers such that RevBinary() = RevDecimal(), where RevDecimal(n) is the decimal reversal of n (A004086) and RevBinary(n) is the binary reversal of n (A030101).at n=19A081434
- Smallest palindrome beginning with n and digit sum n, or 0 if no such number exists.at n=14A082217
- Smallest palindrome beginning with n and a digit sum of n at some stage.at n=14A082935
- a(n) = concatenate(n, A010888(2*n), reverse(n)), where A010888 = digital root.at n=14A082944
- a(1) = 2; then smallest palindrome > 1 not occurring earlier such that every partial concatenation is a prime.at n=43A088086
- a(n) is the least positive integer such that the integer part of the arithmetic-geometric mean of a(n) and 1 is equal to 3^n.at n=7A090856
- 75-gonal numbers: a(n) = n*(73*n-71)/2.at n=21A098230
- Consider all (2n+1)-digit palindromic primes of the form 10...0M0...01 (so that M is a palindrome with <= 2n-1 digits); a(n) = smallest such M.at n=37A100026
- Values of x arising from representations of n >= 11 in A085514.at n=51A102774
- a(n) = denominator of sum of reciprocals of the terms of the continued fraction for H(n) = Sum_{k=1..n} 1/k.at n=14A112287
- Palindromes for which the multiplicative digital root is a prime.at n=23A117059
- Palindromic numbers that contain the sum of their digits as a substring.at n=18A121939