15433
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
- 17856
- Proper Divisor Sum (Aliquot Sum)
- 2423
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13200
- Möbius Function
- -1
- Radical
- 15433
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 84
- 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
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = natural numbers, t = odd natural numbers.at n=43A024862
- Multiplicity of highest weight (or singular) vectors associated with character chi_38 of Monster module.at n=37A034426
- a(n) = Sum_{k=1..floor(n/2)} T(n, 2k), array T as in A049777.at n=43A049779
- Numbers k such that gcd(3k,8^k+1) = 3 but k does not divide the numerator of B(2k) (the Bernoulli numbers).at n=23A070193
- Sieve performed by successive iterations of steps where step m is: keep m terms, remove the next 2 and repeat; as m = 1,2,3,.. the remaining terms form this sequence.at n=34A112560
- Numbers n such that primorial(n)/2 - 4 is prime.at n=18A139440
- Values x corresponding to the records d in A179406.at n=11A179407
- Numbers n such that n!10 + 2 is prime.at n=43A204657
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 545", based on the 5-celled von Neumann neighborhood.at n=24A272836
- a(n) = ((n + 1) - 9*(n + 1)^2 + 8*(n + 1)^3)/6.at n=22A331987
- Rounded value of z(n)*prime(n), where z(n) = imaginary part of n-th nontrivial zero of the Zeta function and prime(n) = n-th prime.at n=33A342756
- Times on the display of a 24-hour digital clock with 6 digits, rounded to full seconds, at which the hour and minute hands of an analog clock form a right angle. Terms with fewer than 6 digits are to be assumed filled with zeros to the left.at n=3A347039
- Odd numbers k such that sigma(k) + sigma(k+2) > 2*sigma(k+1); odd terms in A053228.at n=35A358395