15469
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16000
- Proper Divisor Sum (Aliquot Sum)
- 531
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14940
- Möbius Function
- 1
- Radical
- 15469
- Omega Function (Ω)
- 2
- 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
- 84
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- 11*n^2 + 11*n + 3.at n=37A006222
- a(n) = Sum_{m=1..n} Sum_{k=1..m} prime(k).at n=29A014148
- Numbers whose base-5 representation contains exactly three 3's and three 4's.at n=16A045307
- Polynomial extrapolation of 2, 3, 5, 7, 11, 13, 17.at n=12A061166
- Sum of first n 6-almost primes.at n=30A086052
- Semiprimes that are the sum of the first n semiprimes for some n.at n=24A092190
- Least k such that 10^n + k is a Sophie Germain prime and the lesser of a twin prime pair.at n=20A118580
- 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), (-1, 1, 0), (0, 0, 1), (0, 1, -1), (1, -1, 1)}.at n=10A148166
- Partial sums of A001334.at n=6A177414
- In lunar arithmetic in base 2, the number of divisors of the number 11...1101 (n digits, the binary expansion of 2^n-3).at n=20A188288
- In base-2 lunar arithmetic, out of all odd numbers of length n, it appears that 111..1 (with n ones) has the most lunar divisors; the sequence gives the number of lunar divisors of the runner-up.at n=17A188524
- Number of partitions p of n such that the number of distinct parts is a part or max(p) - min(p) is a part.at n=39A241391
- a(n) is the least m such that A341284(m) = 2*n*prime(m+1) - prime(m).at n=53A342027
- Number of integer partitions of n where the parts have the same median as the distinct parts.at n=47A360245
- Number of integer partitions of n where the parts have greater mean than the distinct parts.at n=54A360250